Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Iterative algebraic decoding of codes defined on graphs

Xiangyu Tang

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

Furthermore, we propose novel error correction coding schemes, called Generalized Integrated Interleaving and Sparsely Integrated Interleaving codes. In the context of block interleaved codewords, Generalized Integrated Interleaving allows nonuniform redundancy to be shared among all the interleaves. This allows the redundancy to be adjusted on-the-fly to better suit the error statistics of the channel or storage device. Sparsely Integrated Interleaving groups data nodes in a distributed storage system into subgroups. A data node can belong to several subgroups. A localized algebraic iterative decoding algorithm is used to decode across subgroups to correct large errors. Very little correction capability is sacrificed to achieve fast error correction and lower communication overhead. This scheme improves data access for all the data nodes and allows easy scaling of the distributed storage network.

Related papers

Based on Quantum Error Correction Codes: Enhancing the Reliability of Distributed Storage

Jincheng Zhang

This paper investigates the application of quantum error correction (QEC) codes to enhance the reliability of distributed storage systems. Traditional distributed storage methods relying on redundancy often suffer from high costs and inefficiencies, particularly in noisy environments. This research proposes leveraging the inherent error-correcting capabilities of QEC codes to provide a more robust and efficient solution. We explore the theoretical foundations of QEC, focusing on the encoding and decoding processes within a distributed storage architecture. The core claim is that the integration of QEC significantly improves data storage reliability, especially when accounting for the challenges posed by transmission noise. The underlying mechanism involves encoding data using appropriate QEC codes and subsequently employing decoding algorithms to identify and correct errors introduced during transmission. We analyze the impact of different QEC code parameters on system performance, considering factors such as code rate, error correction capability, and computational overhead. The results demonstrate the potential of this approach to achieve higher data integrity and reduce the reliance on extensive redundancy, offering a promising pathway for reliable data storage in challenging conditions.

•Sep 2, 2026•0 citations

Algebraic coding for iterative decoding

Pascal O. Vontobel

•Jan 1, 2003•13 citations

Graph Decoding of Array Error-Correcting Codes

Patrick Guy Farrell, Seyed H. Razavi

Lecture notes in computer science•Jan 1, 1999•2 citations

Based on Quantum Error Correction Codes: A Distributed Storage System

Jincheng Zhang

This paper proposes a novel approach to distributed storage system design utilizing quantum error correction (QEC) codes. The core claim is that incorporating QEC allows for robust data redundancy within a distributed system, significantly enhancing data reliability and security against various forms of noise and corruption. The proposed mechanism involves encoding data using selected QEC codes before distribution across the network, effectively mitigating the impact of quantum noise. This work outlines the fundamental principles, key considerations, and potential challenges associated with implementing such a system. Specifically, we explore different QEC codes and their suitability for distributed storage, discuss the overhead associated with encoding and decoding, and address scalability concerns. The research presents a theoretical framework for a QEC-based distributed storage system, demonstrating the potential for significantly improved data preservation compared to traditional redundancy schemes. The system's architecture emphasizes efficient data distribution and retrieval while maintaining the integrity of encoded data. This approach offers a pathway toward building highly resilient storage solutions for applications demanding high data availability and security, particularly in quantum computing environments.

•Aug 31, 2026•0 citations

Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes

Nithin Raveendran

Protecting logical information in the form of a classical bit or a quantum bit (qubit) is an essential step in ensuring fault-tolerant classical or quantum computation. Error correction codes and their decoders perform this step by adding redundant information that aids the decoder to recover or protect the logical information even in the presence of noise. Low-density parity-check (LDPC) codes have been one of the most popular error correction candidates in modern communication and data storage systems. Similarly, their quantum analogues, quantum LDPC codes are being actively pursued as excellent prospects for error correction in future fault-tolerant quantum systems due to their asymptotically non-zero rates, sparse parity check matrices, and efficient iterative decoding algorithms. This dissertation deals with failure configurations, known as \emph{trapping sets} of classical and quantum LDPC codes when decoded with iterative message passing decoding algorithms, and the \emph{error floor phenomenon} - the degradation of logical error rate performance at low physical noise regime. The study of quantum trapping sets will enable the construction of better quantum LDPC codes and also help in modifying iterative quantum decoders to achieve higher fault-tolerant thresholds and lower error floors. Towards this goal, the dissertation also presents iterative decoders for classical and quantum LDPC codes using the \emph{deep neural network framework}, novel iterative decoding algorithms, and a decoder-aware \emph{expansion-contraction method} for error floor estimation. In this dissertation, we first establish a systematic methodology by which one can identify and classify \emph{quantum trapping sets} (QTSs) according to their topological structure and decoder used. For this purpose, we leverage the known harmful configurations in the Tanner graph, called \emph{trapping sets} (TSs), from the classical error correction world. The conventional definition of a trapping set of classical LDPC codes is generalized to address the syndrome decoding scenario for quantum LDPC codes. Furthermore, we show that the knowledge of QTSs can be used to design better quantum LDPC codes and decoders. In the context of the development of novel decoders, we extend the stochastic resonance based decoders to quantum LDPC codes, propose iteration-varying message passing decoders with their message update rules learned by neural networks tuned for low logical error rate, and present a syndrome based generalized belief propagation algorithm for tackling convergence failure of iterative decoders due to the presence of short cycles. Our analysis of TSs of a layered decoding architecture clearly reveals the dependence of the harmfulness of TSs (classical or quantum) on the iterative decoder, and thus on the error floor estimates. We present a computationally efficient method for estimating error floors of LDPC codes over the binary symmetric channel without any prior knowledge of its trapping sets. The sub-graph expansion-contraction method is a general procedure for TS characterization, which lists all harmful error patterns up to a given weight for the LDPC code and decoder. Based on this decoder-aware trapping set characterization for LDPC codes, we propose a model-driven deep neural network (DNN) framework that unfolds the decoding iterations, to design the \emph{decoder diversity of finite alphabet iterative decoders (FAIDs)}. Our decoder diversity DNN-FAID delivers excellent waterfall performance along with a low error floor.

•Jan 1, 2021•1 citation

Improved Decoding of Interleaved AG Codes

Andrew Brown, Lorenz Minder, Amin Shokrollahi

Lecture notes in computer science•Jan 1, 2005•21 citations
Furthermore, we propose novel error correction coding schemes, called Generalized Integrated Interleaving and Sparsely Integrated Interleaving codes. In the context of block interleaved codewords, Generalized Integrated Interleaving allows nonuniform redundancy to be shared among all the interleaves. This allows the redundancy to be adjusted on-the-fly to better suit the error statistics of the channel or storage device. Sparsely Integrated Interleaving groups data nodes in a distributed storage system into subgroups. A data node can belong to several subgroups. A localized algebraic iterative decoding algorithm is used to decode across subgroups to correct large errors. Very little correction capability is sacrificed to achieve fast error correction and lower communication overhead. This scheme improves data access for all the data nodes and allows easy scaling of the distributed storage network.
This paper investigates the application of quantum error correction (QEC) codes to enhance the reliability of distributed storage systems. Traditional distributed storage methods relying on redundancy often suffer from high costs and inefficiencies, particularly in noisy environments. This research proposes leveraging the inherent error-correcting capabilities of QEC codes to provide a more robust and efficient solution. We explore the theoretical foundations of QEC, focusing on the encoding and decoding processes within a distributed storage architecture. The core claim is that the integration of QEC significantly improves data storage reliability, especially when accounting for the challenges posed by transmission noise. The underlying mechanism involves encoding data using appropriate QEC codes and subsequently employing decoding algorithms to identify and correct errors introduced during transmission. We analyze the impact of different QEC code parameters on system performance, considering factors such as code rate, error correction capability, and computational overhead. The results demonstrate the potential of this approach to achieve higher data integrity and reduce the reliance on extensive redundancy, offering a promising pathway for reliable data storage in challenging conditions.
This paper proposes a novel approach to distributed storage system design utilizing quantum error correction (QEC) codes. The core claim is that incorporating QEC allows for robust data redundancy within a distributed system, significantly enhancing data reliability and security against various forms of noise and corruption. The proposed mechanism involves encoding data using selected QEC codes before distribution across the network, effectively mitigating the impact of quantum noise. This work outlines the fundamental principles, key considerations, and potential challenges associated with implementing such a system. Specifically, we explore different QEC codes and their suitability for distributed storage, discuss the overhead associated with encoding and decoding, and address scalability concerns. The research presents a theoretical framework for a QEC-based distributed storage system, demonstrating the potential for significantly improved data preservation compared to traditional redundancy schemes. The system's architecture emphasizes efficient data distribution and retrieval while maintaining the integrity of encoded data. This approach offers a pathway toward building highly resilient storage solutions for applications demanding high data availability and security, particularly in quantum computing environments.
Protecting logical information in the form of a classical bit or a quantum bit (qubit) is an essential step in ensuring fault-tolerant classical or quantum computation. Error correction codes and their decoders perform this step by adding redundant information that aids the decoder to recover or protect the logical information even in the presence of noise. Low-density parity-check (LDPC) codes have been one of the most popular error correction candidates in modern communication and data storage systems. Similarly, their quantum analogues, quantum LDPC codes are being actively pursued as excellent prospects for error correction in future fault-tolerant quantum systems due to their asymptotically non-zero rates, sparse parity check matrices, and efficient iterative decoding algorithms. This dissertation deals with failure configurations, known as \emph{trapping sets} of classical and quantum LDPC codes when decoded with iterative message passing decoding algorithms, and the \emph{error floor phenomenon} - the degradation of logical error rate performance at low physical noise regime. The study of quantum trapping sets will enable the construction of better quantum LDPC codes and also help in modifying iterative quantum decoders to achieve higher fault-tolerant thresholds and lower error floors. Towards this goal, the dissertation also presents iterative decoders for classical and quantum LDPC codes using the \emph{deep neural network framework}, novel iterative decoding algorithms, and a decoder-aware \emph{expansion-contraction method} for error floor estimation. In this dissertation, we first establish a systematic methodology by which one can identify and classify \emph{quantum trapping sets} (QTSs) according to their topological structure and decoder used. For this purpose, we leverage the known harmful configurations in the Tanner graph, called \emph{trapping sets} (TSs), from the classical error correction world. The conventional definition of a trapping set of classical LDPC codes is generalized to address the syndrome decoding scenario for quantum LDPC codes. Furthermore, we show that the knowledge of QTSs can be used to design better quantum LDPC codes and decoders. In the context of the development of novel decoders, we extend the stochastic resonance based decoders to quantum LDPC codes, propose iteration-varying message passing decoders with their message update rules learned by neural networks tuned for low logical error rate, and present a syndrome based generalized belief propagation algorithm for tackling convergence failure of iterative decoders due to the presence of short cycles. Our analysis of TSs of a layered decoding architecture clearly reveals the dependence of the harmfulness of TSs (classical or quantum) on the iterative decoder, and thus on the error floor estimates. We present a computationally efficient method for estimating error floors of LDPC codes over the binary symmetric channel without any prior knowledge of its trapping sets. The sub-graph expansion-contraction method is a general procedure for TS characterization, which lists all harmful error patterns up to a given weight for the LDPC code and decoder. Based on this decoder-aware trapping set characterization for LDPC codes, we propose a model-driven deep neural network (DNN) framework that unfolds the decoding iterations, to design the \emph{decoder diversity of finite alphabet iterative decoders (FAIDs)}. Our decoder diversity DNN-FAID delivers excellent waterfall performance along with a low error floor.