English
Related papers

Related papers: On Generalized LDPC Codes for 5G Ultra Reliable Co…

200 papers

Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth…

Quantum Physics · Physics 2026-01-21 Kenta Kasai

A novel method guaranteeing nondecreasing girth is presented for constructing longer low-density parity-check (LDPC) codes from shorter ones. The parity-check matrix of a shorter base code is decomposed into N (N>=2) non-overlapping…

Information Theory · Computer Science 2018-01-29 Guohua Zhang , Yulin Hu , Qinwei He

The error correction performance of low-density parity-check (LDPC) codes under iterative message-passing decoding is degraded by the presence of certain harmful objects existing in their Tanner graph representation. Depending on the…

Information Theory · Computer Science 2019-04-16 Massimo Battaglioni , Franco Chiaraluce , Marco Baldi , David Mitchell

Distributed storage systems suffer from significant repair traffic generated due to frequent storage node failures. This paper shows that properly designed low-density parity-check (LDPC) codes can substantially reduce the amount of…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-17 Hyegyeong Park , Dongwon Lee , Jaekyun Moon

Quantum low-density parity-check (QLDPC) codes have been proven to achieve higher minimum distances at higher code rates than surface codes. However, this family of codes imposes stringent latency requirements and poor performance under…

Information Theory · Computer Science 2024-06-26 Dimitris Chytas , Nithin Raveendran , Bane Vasić

In this paper, we propose a new design method of irregular spatially-coupled low-density parity-check (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Jong-Seon No , Hosung Park

We propose new grouping methods for group shuffled (GS) decoding of both regular and irregular low-density parity check cods. These methods are independent of the check-to-variable message formula used. Integer-valued metrics for measuring…

Information Theory · Computer Science 2018-04-03 Tofar C. -Y. Chang , Yu T. Su

This paper describes the design and C99 implementation of a free and open-source Low-Density Parity-Check (LDPC) codes encoder and decoder focused primarily on the Quasi-Cyclic LDPC (QCLDPC) codes utilized in the IEEE 802.11ax-2021 (Wi-Fi…

Information Theory · Computer Science 2023-06-22 Tomas Palenik , Viktor Szitkey

With the development of quantum error correction techniques, quantum low density parity check (QLDPC) codes become a promising area in quantum error correction codes. In this paper, the requirements of QLDPC codes based on points except the…

Quantum Algebra · Mathematics 2023-10-04 Ya'nan Feng , Chuchen Tang , Chenming Bai

Quantum error correction suppresses noise in quantum systems to allow for high-precision computations. In this work, we introduce Multivariate Bicycle (MB) Quantum Low-Density Parity-Check (QLDPC) codes, via an extension of the framework…

Quantum Physics · Physics 2025-02-21 Lukas Voss , Sim Jian Xian , Tobias Haug , Kishor Bharti

A variation of low density parity check (LDPC) error correcting codes defined over Galois fields ($GF(q)$) is investigated using statistical physics. A code of this type is characterised by a sparse random parity check matrix composed of…

Statistical Mechanics · Physics 2009-10-31 Kazutaka Nakamura , Yoshiyuki Kabashima , David Saad

The main goal of coding theory is to devise efficient systems to exploit the full capacity of a communication channel, thus achieving an arbitrarily small error probability. Low Density Parity Check (LDPC) codes are a family of block…

Information Theory · Computer Science 2009-07-18 L. Giuzzi , A. Sonnino

A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new…

Information Theory · Computer Science 2007-07-13 Oscar Y. Takeshita

Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such systems, analog information obtained from the syndrome…

Quantum Physics · Physics 2025-05-13 Shantom K. Borah , Asit K. Pradhan , Nithin Raveendran , Michele Pacenti , Bane Vasic

In this study, a scheduling policy of layered decoding for quasi-cycle (QC) low-density parity-check (LDPC) codes with high throughput and good performance is designed. The influence of scheduling on the delay of the decoder's hardware…

Information Theory · Computer Science 2025-05-27 Dongxu Chang , Qingqing Peng , Guanghui Wang , Guiying Yan

Novel sparse regression LDPC (SR-LDPC) codes exhibit excellent performance over additive white Gaussian noise (AWGN) channels in part due to their natural provision of shaping gains. Though SR-LDPC-like codes have been considered within the…

Information Theory · Computer Science 2024-02-13 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

We investigate iterative low-resolution message-passing algorithms for quasi-cyclic LDPC codes with horizontal and vertical layered schedules. Coarse quantization and layered scheduling are highly relevant for hardware implementations to…

Information Theory · Computer Science 2022-12-19 Philipp Mohr , Gerhard Bauch

Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D$^\prime$ lattices. Using their algorithm, we propose a Construction D$^\prime$ lattice based on binary quasi-cyclic low-density…

Information Theory · Computer Science 2018-10-05 Siyu Chen , Brian M. Kurkoski , Eirik Rosnes

Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an ideal maximum-distance-separable code on the binary erasure…

Information Theory · Computer Science 2008-04-21 Enrico Paolini , Gianluigi Liva , Michela Varrella , Balazs Matuz , Marco Chiani

In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of simple product code structure is proposed based on combining two independently received soft-decision data for the same codeword. LDPC codes…

Information Theory · Computer Science 2024-10-30 Beomkyu Shin , Seokbeom Hong , Hosung Park , Jong-Seon No , Dong-Joon Shin