English
Related papers

Related papers: Extended Non-Binary Low-Density Parity-Check Codes…

200 papers

We propose several improvements for Linear Programming (LP) decoding algorithms for High Density Parity Check (HDPC) codes. First, we use the automorphism groups of a code to create parity check matrix diversity and to generate valid cuts…

Information Theory · Computer Science 2016-11-18 Alex Yufit , Asi Lifshitz , Yair Be'ery

We propose a new code design that aims to distribute an LDPC code over a relay channel. It is based on a split-and-extend approach, which allows the relay to split the set of bits connected to some parity-check of the LDPC code into two or…

Information Theory · Computer Science 2010-04-30 Valentin Savin

In this paper, we investigate novel strategies for generating rate-compatible (RC) irregular low-density parity-check (LDPC) codes with short/moderate block lengths. We propose three puncturing and two extension schemes, which are designed…

Information Theory · Computer Science 2014-07-22 J. Liu , R. C. de Lamare

For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at…

Information Theory · Computer Science 2016-11-17 Arunkumar Subramanian , Andrew Thangaraj , Matthieu Bloch , Steven W. McLaughlin

We analyze nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group for transmission over the binary erasure channel. We prove threshold saturation of the belief propagation decoding to the…

Information Theory · Computer Science 2014-07-23 Alexandre Graell i Amat , Iryna Andriyanova , Amina Piemontese

We propose a new low-density parity-check code construction scheme based on 2-lifts. The proposed codes have an advantage of admitting efficient hardware implementations. With the motivation of designing codes with low error floors, we…

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

We consider transmission over a binary-input additive white Gaussian noise channel using low-density parity-check codes. One of the most popular techniques for decoding low-density parity-check codes is the linear programming decoder. In…

Information Theory · Computer Science 2015-03-19 Shrinivas Kudekar , Jason K. Johnson , Misha Chertkov

This work shows how non-binary low-density parity-check codes over GF($2^p$) can be combined with probabilistic amplitude shaping (PAS) (B\"ocherer, et al., 2015), which combines forward-error correction with non-uniform signaling for…

Information Theory · Computer Science 2017-08-21 Fabian Steiner , Gianluigi Liva , Georg Böcherer

We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) code and belief propagation (BP) decoding. The bit error probability for infinite block length is known by density evolution and it is…

Information Theory · Computer Science 2008-01-23 Ryuhei Mori , Kenta Kasai , Tomoharu Shibuya , Kohichi Sakaniwa

Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at…

Information Theory · Computer Science 2016-11-18 Mahdi Ramezani , Masoud Ardakani

Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations…

Information Theory · Computer Science 2016-11-18 Gottfried Lechner , Troels Pedersen , Gerhard Kramer

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

In this paper, we propose an efficient method to reduce error floors in quantum error correction using non-binary low-density parity-check (LDPC) codes. We identify and classify cycle structures in the parity-check matrix where estimated…

Quantum Physics · Physics 2025-04-29 Kenta Kasai

Low-density parity-check (LDPC) codes are an important feature of several communication and storage applications, offering a flexible and effective method for error correction. These codes are computationally complex and require the…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-06 Oscar Ferraz , Vitor Silva , Gabriel Falcao

Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor…

Information Theory · Computer Science 2016-08-17 C. T. Healy , R. C. de Lamare

An error-erasure channel is a simple noise model that introduces both errors and erasures. While the two types of errors can be corrected simultaneously with error-correcting codes, it is also known that any linear code allows for first…

Information Theory · Computer Science 2019-03-19 Yu Tsunoda , Yuichiro Fujiwara , Hana Ando , Peter Vandendriessche

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. The aim of LP decoding is to develop an algorithm which has error-correcting performance…

Information Theory · Computer Science 2010-10-05 Mayur Punekar , Mark F. Flanagan

In modern data storage systems, non-binary LDPC codes for recovering from disk failures are increasingly considered strong competitors to MDS codes such as Reed-Solomon codes. Since disk failures can be modeled as erasures, we analyze…

Information Theory · Computer Science 2026-05-28 Irina Bocharova , Boris Kudryashov , Henk D. L. Hollmann , Vitaly Skachek

In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition.…

Information Theory · Computer Science 2019-01-24 Jing Bai , Yongchao Wang , Francis C. M. Lau

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