English
Related papers

Related papers: Study of Structured Root-LDPC Codes and PEG Techni…

200 papers

For efficient modulation and error control coding, the deliberate flipping approach imposes the run-length-limited(RLL) constraint by bit error before recording. From the read side, a high coding rate limits the correcting capability of RLL…

Information Theory · Computer Science 2023-10-11 Hong-fu Chou

Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to generally as quantum low-density parity-check (QLDPC) codes --…

Quantum Physics · Physics 2025-10-20 Bane Vasic , Valentin Savin , Michele Pacenti , Shantom Borah , Nithin Raveendran

Continuous-variable quantum key distribution utilizes an ensemble of coherent states of light to distribute secret encryption keys between two parties. One of the challenges is thereby the requirement of capacity approaching error…

Information Theory · Computer Science 2021-06-30 Hossein Mani , Tobias Gehring , Christoph Pacher , Ulrik Lund Andersen

In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes, a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes…

Information Theory · Computer Science 2021-01-06 Peng W. Zhang , Francis C. M. Lau , Chiu-W. Sham

Regular spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we…

Information Theory · Computer Science 2018-02-20 Vahid Aref , Narayanan Rengaswamy , Laurent Schmalen

Generalized low-density parity-check (GLDPC) codes, where single parity-check (SPC) constraint nodes are replaced with generalized constraint (GC) nodes, are a promising class of codes for low latency communication. In this paper, a…

Information Theory · Computer Science 2019-10-16 Yanfang Liu , Pablo M. Olmos , David G. M. Mitchell

We study error bounds for linear programming decoding of regular LDPC codes. For memoryless binary-input output-symmetric channels, we prove bounds on the word error probability that are inverse doubly-exponential in the girth of the factor…

Information Theory · Computer Science 2011-04-12 Nissim Halabi , Guy Even

Low density parity check (LDPC) lattices are obtained from Construction D' and a family of nested binary LDPC codes. We consider an special case of these lattices with one binary LDPC code as underlying code. This special case of LDPC…

Information Theory · Computer Science 2016-08-15 Hassan Khodaiemehr , Dariush Kiani , Mohammad-Reza Sadeghi

This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…

Information Theory · Computer Science 2015-02-23 Terry Ferrett , Matthew C. Valenti

Non-binary low-density parity-check (LDPC) codes have some advantages over their binary counterparts, but unfortunately their decoding complexity is a significant challenge. The iterative hard- and soft-reliability based majority-logic…

Information Theory · Computer Science 2015-06-22 Chenrong Xiong , Zhiyuan Yan

This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying…

Information Theory · Computer Science 2016-11-17 Peyman Razaghi , Wei Yu

This paper basically expresses the core fundamentals and brief overview of the research of R. G. GALLAGER [1] on Low-Density Parity-Check (LDPC) codes and various parameters related to LDPC codes like, encoding and decoding of LDPC codes,…

Information Theory · Computer Science 2020-09-21 Saumya Borwankar , Dhruv Shah

This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a…

Information Theory · Computer Science 2017-01-30 Mohamad Khas Mohamadi , Hamid Saeedi , Reza Asvadi

This paper uses the reconstruction-computation-quantization (RCQ) paradigm to decode low-density parity-check (LDPC) codes. RCQ facilitates dynamic non-uniform quantization to achieve good frame error rate (FER) performance with very low…

Signal Processing · Electrical Eng. & Systems 2022-02-10 Linfang Wang , Caleb Terrill , Maximilian Stark , Zongwang Li , Sean Chen , Chester Hulse , Calvin Kuo , Richard Wesel , Gerhard Bauch , Rekha Pitchumani

This paper considers the performance of $(j,k)$-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC…

Information Theory · Computer Science 2012-02-01 Fan Zhang , Henry D. Pfister

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…

Information Theory · Computer Science 2016-11-18 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

A class of doubly-generalized low-density parity-check (D-GLDPC) codes, where single parity-check (SPC) codes are used as variable nodes (VNs), is investigated. An expression for the growth rate of the weight distribution of any D-GLDPC…

Information Theory · Computer Science 2016-11-17 E. Paolini , M. F. Flanagan , M. Chiani , M. P. C. Fossorier

We introduce fair-density parity-check (FDPC) codes targeting high-rate applications. In particular, we start with a base parity-check matrix $H_b$ of dimension $2 \sqrt{n} \times n$, where $n$ is the code block length, and the number of…

Information Theory · Computer Science 2024-02-13 Hessam Mahdavifar

In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization algorithm is…

Information Theory · Computer Science 2014-05-27 Shahrouz Sharifi , A. Korhan Tanc , Tolga M. Duman

This paper investigates the design of spatially coupled low-density parity-check (SC-LDPC) codes constructed from connected-chain ensembles for bit-interleaved coded modulation (BICM) schemes. For short coupling lengths, connecting multiple…

Information Theory · Computer Science 2021-07-08 Yihuan Liao , Min Qiu , Jinhong Yuan