English
Related papers

Related papers: Spatially Coupled LDPC Codes for Decode-and-Forwar…

200 papers

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that have excellent performance thanks to the degrees of freedom they offer. An SC code is designed by partitioning a base matrix into components, the number…

Information Theory · Computer Science 2026-05-11 Bade Aksoy , Doğukan Özbayrak , Ahmed Hareedy

Quantum low-density parity-check (LDPC) codes are a promising family of quantum error-correcting codes for fault tolerant quantum computing with low overhead. Decoding quantum LDPC codes on quantum erasure channels has received more…

Information Theory · Computer Science 2024-11-20 Mert Gökduman , Hanwen Yao , Henry D. Pfister

This paper is devoted to the finite-length analysis of turbo decoding over the binary erasure channel (BEC). The performance of iterative belief-propagation (BP) decoding of low-density parity-check (LDPC) codes over the BEC can be…

Information Theory · Computer Science 2011-05-31 Eirik Rosnes , Øyvind Ytrehus

The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of…

Information Theory · Computer Science 2010-07-28 Enrico Paolini , Marc Fossorier , Marco Chiani

Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to have at our disposal a fast decoding algorithm to quickly…

Quantum Physics · Physics 2020-07-15 Nicolas Delfosse , Gilles Zémor

We provide $poly\log$ sparse quantum codes for correcting the erasure channel arbitrarily close to the capacity. Specifically, we provide $[[n, k, d]]$ quantum stabilizer codes that correct for the erasure channel arbitrarily close to the…

Quantum Physics · Physics 2017-07-27 Seth Lloyd , Peter Shor , Kevin Thompson

Convolutional LDPC ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing as a function of the average degree. Several variations on the basic theme have been proposed to…

Information Theory · Computer Science 2016-11-17 Shrinivas Kudekar , Tom Richardson , Ruediger Urbanke

In this paper, we propose a new rateless coded cooperation scheme for a general multi-user cooperative wireless system. We develop cooperation methods based on Raptor codes with the assumption that the channels face erasure with specific…

Information Theory · Computer Science 2016-11-15 Mahyar Shirvanimoghaddam , Yonghui Li , Shuang Tian , Branka Vucetic

In this paper, we design the optimal rate capacity approaching irregular Low-Density Parity-Check code ensemble over Binary Erasure Channel, by using practical Semi-Definite Programming approach. Our method does not use any relaxation or…

Information Theory · Computer Science 2012-11-28 H. Tavakoli , M. Ahmadian , M. Reza Peyghami

In this work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation…

Information Theory · Computer Science 2018-10-03 Kevin Klaiber , Sebastian Cammerer , Laurent Schmalen , Stephan ten Brink

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

Physical-layer Network Coding (PNC) can significantly improve the throughput of two-way relay channels. An interesting variant of PNC is Analog Network Coding (ANC). Almost all ANC schemes proposed to date, however, operate in a symbol by…

Information Theory · Computer Science 2011-10-17 Shengli Zhang , Soung-Chang Liew , Qingfeng Zhou , Lu Lu , Hui Wang

We consider a queue-channel model that captures the waiting time-dependent degradation of information bits as they wait to be transmitted. Such a scenario arises naturally in quantum communications, where quantum bits tend to decohere…

Information Theory · Computer Science 2023-05-09 Jaswanthi Mandalapu , Krishna Jagannathan , Avhishek Chatterjee , Andrew Thangaraj

The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed. In the past, lower bounds on the error exponents were derived. In this paper a probabilistic upper bound on this…

Information Theory · Computer Science 2008-03-18 Idan Goldenberg , David Burshtein

This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Zm and binary low-density parity-check (LDPC) codes, assuming belief propagation decoding on memoryless channels. A concrete framework is presented,…

Information Theory · Computer Science 2007-07-13 Chih-Chun Wang , Sanjeev R. Kulkarni , H. Vincent Poor

We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…

Information Theory · Computer Science 2022-07-12 YuHao Liu , Teng Fu , Jean Barbier , TianQi Hou

Kudekar et al. proved that the belief-propagation (BP) performance for low-density parity check (LDPC) codes can be boosted up to the maximum-a-posteriori (MAP) performance by spatial coupling. In this paper, spatial coupling is applied to…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi , Toshiyuki Tanaka , Tsutomu Kawabata

We address the problem of the joint sequence detection in partial-response (PR) channels and decoding of low-density parity-check (LDPC) codes. We model the PR channel and the LDPC code as a combined inference problem. We present for the…

Information Theory · Computer Science 2009-04-07 Jaime A. Anguita , Michael Chertkov , Mark A. Neifeld , Bane Vasic

We introduce a new family of concatenated codes with an outer low-density parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code, and prove that these codes can achieve capacity under any memoryless binary-input…

Information Theory · Computer Science 2016-08-31 Chun-Hao Hsu , Achilleas Anastasopoulos

In this letter, we propose a reliability-based windowed decoding scheme for spatially-coupled (SC) low-density parity-check (LDPC) codes. To mitigate the error propagation along the sliding windowed decoder of the SC LDPC codes, a partial…

Information Theory · Computer Science 2018-05-10 Peng Kang , Yixuan Xie , Lei Yang , Jinhong Yuan