English
Related papers

Related papers: Quantized Iterative Message Passing Decoders with …

200 papers

Efficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies. In this…

Quantum Physics · Physics 2026-03-02 Guoding Liu , Zhenyu Du , Zi-Wen Liu , Xiongfeng Ma

This paper considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to JD of…

Information Theory · Computer Science 2015-05-27 Byung-Hak Kim , Henry D. Pfister

Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers. One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder. In this…

Quantum Physics · Physics 2025-02-18 Sisi Miao , Alexander Schnerring , Haizheng Li , Laurent Schmalen

We discuss and analyze a list-message-passing decoder with verification for low-density parity-check (LDPC) codes on the q-ary symmetric channel (q-SC). Rather than passing messages consisting of symbol probabilities, this decoder passes…

Information Theory · Computer Science 2015-03-13 Fan Zhang , Henry D. Pfister

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

Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC). This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes by…

Quantum Physics · Physics 2023-11-22 Arshpreet Singh Maan , Alexandru Paler

Characterizing the decoding failure rate of iteratively decoded Low- and Moderate-Density Parity Check (LDPC/MDPC) codes is paramount to build cryptosystems based on them, able to achieve indistinguishability under adaptive chosen…

Cryptography and Security · Computer Science 2019-12-12 Paolo Santini , Alessandro Barenghi , Gerardo Pelosi , Marco Baldi , Franco Chiaraluce

In this paper, we study the data gathering problem in the context of power grids by using a network of sensors, where the sensed data have inter-node redundancy. Specifically, we propose a new transmission method, calledquantized network…

Information Theory · Computer Science 2012-10-29 Mahdy Nabaee , Fabrice Labeau

Linear programming (LP) decoding for low-density parity-check (LDPC) codes proposed by Feldman et al. is shown to have theoretical guarantees in several regimes and empirically is not observed to suffer from an error floor. However at low…

Information Theory · Computer Science 2016-11-18 Xishuo Liu , Stark C. Draper

Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes \cite{Kschischang01}. An…

Information Theory · Computer Science 2009-08-27 Xudong Ma , En-hui Yang

A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a comparable or even better performance than corresponding non-adaptive alternatives. In each iteration the variable…

Information Theory · Computer Science 2009-04-24 Ingmar Land , Gottfried Lechner , Lars K. Rasmussen

Ensuring extremely high reliability in channel coding is essential for 6G networks. The next-generation of ultra-reliable and low-latency communications (xURLLC) scenario within 6G networks requires frame error rate (FER) below $10^{-9}$.…

Information Theory · Computer Science 2024-11-18 Hee-Youl Kwak , Dae-Young Yun , Yongjune Kim , Sang-Hyo Kim , Jong-Seon No

In this paper, we propose a framework of the mutual information-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes by using simple mappings and fixed-point additions. Our decoding method is generic in the sense…

Information Theory · Computer Science 2022-02-15 Peng Kang , Kui Cai , Xuan He , Shuangyang Li , Jinhong Yuan

The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For…

Information Theory · Computer Science 2007-07-13 Chun-Hao Hsu , Achilleas Anastasopoulos

Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have…

Quantum Physics · Physics 2026-04-10 Andi Gu , J. Pablo Bonilla Ataides , Mikhail D. Lukin , Susanne F. Yelin

This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding. Indeed, these codes feature simultaneously a sparse parity check matrix,…

Information Theory · Computer Science 2009-01-23 Alexandre Soro , Mathieu Cunche , Jerome Lacan , Vincent Roca

Fault-tolerant quantum computation demands extremely low logical error rates, yet superconducting qubit arrays are subject to radiation-induced correlated noise arising from cosmic-ray muon-generated quasiparticles. The quasiparticle…

For LDPC codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario,…

Information Theory · Computer Science 2012-12-07 Jiadong Wang , Lara Dolecek , Richard Wesel

We face the following dilemma for designing low-density parity-check codes (LDPC) for quantum error correction. 1) The row weights of parity-check should be large: The minimum distances are bounded above by the minimum row weights of…

Information Theory · Computer Science 2011-02-16 Manabu Hagiwara , Kenta Kasai , Hideki Imai , Kohichi Sakaniwa

A ternary message passing (TMP) decoding algorithm for low-density parity-check codes is developed. All messages exchanged between variable and check nodes have a ternary alphabet, and the variable nodes exploit soft information from the…

Information Theory · Computer Science 2018-10-12 Emna Ben Yacoub , Fabian Steiner , Balazs Matuz , Gianluigi Liva