English
Related papers

Related papers: Generalized Quasi-Cyclic LDPC Codes: Design and Ef…

200 papers

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range…

Information Theory · Computer Science 2024-02-20 Yuqing Ren , Hassan Harb , Yifei Shen , Alexios Balatsoukas-Stimming , Andreas Burg

Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low…

Information Theory · Computer Science 2012-04-13 Zhiqiang Cui , Zhongfeng Wang , Xinmiao Zhang

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

High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are highly desirable for achieving fault-tolerant quantum computing. Recently, quantum error correction has experienced…

Quantum Physics · Physics 2025-01-31 Laura Pecorari , Sven Jandura , Gavin K. Brennen , Guido Pupillo

An algebraic group ring method for constructing codes with no short cycles in the check matrix is derived. It is shown that the matrix of a group ring element has no short cycles if and only if the collection of group differences of this…

Rings and Algebras · Mathematics 2008-07-23 Ted Hurley , Paul McEvoy , Jakub Wenus

Recent work by Divsalar et al. has shown that properly designed protograph-based low-density parity-check (LDPC) codes typically have minimum (Hamming) distance linearly increasing with block length. This fact rests on ensemble arguments…

Information Theory · Computer Science 2013-02-22 Brian K. Butler , Paul H. Siegel

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

Information Theory · Computer Science 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

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

Quantum low-density parity-check (qLDPC) codes are quantum stabilizer codes where each stabilizer acts on a constant number of qubits and each qubit is acted on by a constant number of stabilizers. We study qLDPC codes constructed from…

Quantum Physics · Physics 2022-03-08 Ting-Chun Lin , Min-Hsiu Hsieh

Rate-matching of low-density parity-check (LDPC) codes enables a single code description to support a wide range of code lengths and rates. In 5G NR, rate matching is accomplished by extending (lifting) a base code to a desired target…

Information Theory · Computer Science 2024-10-29 Reinhard Wiesmayr , Darja Nonaca , Chris Dick , Christoph Studer

Quantum low-density parity-check (QLDPC) codes with good parameters are promising candidates for low-overhead fault-tolerant quantum computing, but their non-local stabilizers require long-range connectivity and frequent qubit movement,…

Quantum Physics · Physics 2026-04-29 Swayangprabha Shaw , Narayanan Rengaswamy

Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and…

Information Theory · Computer Science 2016-11-18 Asit Kumar Pradhan , Andrew Thangaraj , Arunkumar Subramanian

This paper proposes a new method of constructing compact fully-connected Quasi-Cyclic Low Density Parity Check (QC-LDPC) codes with girth g = 8, 10, and 12. The originality of the proposed method is to impose constraints on the exponent…

Information Theory · Computer Science 2021-10-14 Alireza Tasdighi , Emmanuel Boutillon

In this paper, the stability condition for low-density parity-check (LDPC) codes on the binary erasure channel (BEC) is extended to generalized LDPC (GLDPC) codes and doublygeneralized LDPC (D-GLDPC) codes. It is proved that, in both cases,…

Information Theory · Computer Science 2016-11-15 E. Paolini , M. Fossorier , M. Chiani

In this paper, we propose how to simply construct a pair of linear codes for the BB84 quantum key distribution protocol. This protocol allows unconditional security in the presence of an eavesdropper, and the pair of linear codes is used…

Quantum Physics · Physics 2007-05-23 Maki Ohata , Kanta Matsuura

In this paper, two-user Gaussian interference channel(GIC) is revisited with the objective of developing implementable (explicit) channel codes. Specifically, low density parity check (LDPC) codes are adopted for use over these channels,…

Information Theory · Computer Science 2013-11-01 Shahrouz Sharifi , Tolga M. Duman

In this work, we propose the integration of GLDPC codes with short polar-like component codes, termed GLDPC codes with polar component codes (GLDPC-PC). This approach leverages the good distance properties of polar-like codes and mitigates…

Information Theory · Computer Science 2024-05-10 Binghui Shi , Yongpeng Wu , Yin Xu , Xiqi Gao , Xiaohu You , Wenjun Zhang

An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low…

Information Theory · Computer Science 2016-11-17 Alex Bazarsky , Noam Presman , Simon Litsyn

An ultra-high throughput low-density parity check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to previously reported LDPC decoders in the literature. The…

The recent success in constructing asymptotically good quantum low-density parity-check (QLDPC) codes makes this family of codes a promising candidate for error-correcting schemes in quantum computing. However, conventional belief…

Information Theory · Computer Science 2023-03-22 Sisi Miao , Alexander Schnerring , Haizheng Li , Laurent Schmalen