English
Related papers

Related papers: Check Reliability Based Bit-Flipping Decoding Algo…

200 papers

Decoder diversity is a powerful error correction framework in which a collection of decoders collaboratively correct a set of error patterns otherwise uncorrectable by any individual decoder. In this paper, we propose a new approach to…

Information Theory · Computer Science 2021-05-11 Xin Xiao , Nithin Raveendran , Bane Vasic , Shu Lin , Ravi Tandon

In this work, we propose a fully differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural…

Quantum Physics · Physics 2026-05-14 Anqi Gong , Sebastian Cammerer , Joseph M. Renes

LT codes and digital fountain techniques have received significant attention from both academics and industry in the past few years. There have also been extensive interests in applying LT code techniques to distributed storage systems such…

Information Theory · Computer Science 2012-07-25 Yongge Wang

In streaming applications, doping improves the performance of spatially-coupled low-density parity-check (SC-LDPC) codes by creating reduced-degree check nodes in the coupled chain. We formulate a scaling law to predict the bit and block…

Information Theory · Computer Science 2021-04-23 Roman Sokolovskii , Alexandre Graell i Amat , Fredrik Brännström

Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…

Quantum Physics · Physics 2018-10-23 Ben Criger , Imran Ashraf

We present a new decoder for the surface code, which combines the accuracy of the tensor-network decoders with the efficiency and parallelism of the belief-propagation algorithm. Our main idea is to replace the expensive tensor-network…

Quantum Physics · Physics 2024-04-17 Aviad Kaufmann , Itai Arad

A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The proposed method termed belief-propagation--list erasure decoding…

Information Theory · Computer Science 2017-05-29 Irina E. Bocharova , Boris D. Kudryashov , Vitaly Skachek , Yauhen Yakimenka

Low-density parity-check (LDPC) codes are among the most prominent error-correction schemes. They find application to fortify various modern storage, communication, and computing systems. Protograph-based (PB) LDPC codes offer many degrees…

Information Theory · Computer Science 2025-12-29 Ata Tanrıkulu , Mete Yıldırım , Ahmed Hareedy

Quantum error correction is the building block for constructing fault-tolerant quantum processors that can operate reliably even if its constituting elements are corrupted by decoherence. In this context, real-time decoding is a necessity…

Quantum Physics · Physics 2024-02-15 Antonio deMarti iOlius , Josu Etxezarreta Martinez

We propose a reduced complexity approach to pattern-based soft decoding of block codes. We start from the ORDEPT decoding algorithm which tests a list of partial error patterns organized in the order of their likelihood and attempts to…

Signal Processing · Electrical Eng. & Systems 2025-06-26 Reza Hadavian , Dmitri Truhachev

We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel…

Information Theory · Computer Science 2019-09-20 Alireza Sheikh , Alexandre Graell i Amat , Gianluigi Liva

In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques…

Information Theory · Computer Science 2007-07-16 Lucile Sassatelli , David Declercq

We introduce a two-stage decimation process to improve the performance of neural belief propagation (NBP), recently introduced by Nachmani et al., for short low-density parity-check (LDPC) codes. In the first stage, we build a list by…

Information Theory · Computer Science 2020-11-05 Andreas Buchberger , Christian Häger , Henry D. Pfister , Laurent Schmalen , Alexandre Graell i Amat

Consider an ensemble of regular generalized LDPC (GLDPC) codes and assume that the same component code is associated with each parity check node. To decode a GLDPC code from the ensemble, we use the bit flipping bounded distance decoding…

Information Theory · Computer Science 2025-07-17 David Burshtein

The key to successive cancellation (SC) flip decoding of polar codes is to accurately identify the first error bit. The optimal flipping strategy is considered difficult due to lack of an analytical solution. Alternatively, we propose a…

Information Theory · Computer Science 2019-02-26 Xianbin Wang , Huazi Zhang , Rong Li , Lingchen Huang , Shengchen Dai , Yourui Huangfu , Jun Wang

We establish that a large, flexible class of long, high redundancy error correcting codes can be efficiently and accurately decoded with guessing random additive noise decoding (GRAND). Performance evaluation demonstrates that it is…

Information Theory · Computer Science 2025-12-18 Peihong Yuan , Muriel Medard , Kevin Galligan , Ken R. Duffy

The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's…

Quantum Physics · Physics 2026-03-06 Andrey Boris Khesin , Jonathan Z. Lu

A new approach for combining non-binary low-density parity-check (NB-LDPC) codes with higher-order modulation and probabilistic amplitude shaping (PAS) is presented. Instead of symbol-metric decoding (SMD), a bit-metric decoder (BMD) is…

Information Theory · Computer Science 2018-09-12 Fabian Steiner , Georg Böcherer , Gianluigi Liva

This paper proposes a generalization of the recently introduced Successive Cancellation Flip (SCFlip) decoding of polar codes, characterized by a number of extra decoding attempts, where one or several positions are flipped from the…

Information Theory · Computer Science 2017-03-14 Ludovic Chandesris , Valentin Savin , David Declercq

In this paper, we propose a new class of quantized message-passing decoders for LDPC codes over the BSC. The messages take values (or levels) from a finite set. The update rules do not mimic belief propagation but instead are derived using…

Information Theory · Computer Science 2016-11-15 Shiva Kumar Planjery , David Declercq , Shashi Kiran Chilappagari , Bane Vasić