Publication
The Stability of Low-Density Parity-Check Codes and Some of its Consequences
Related publications (50)
Exchange of Limits: Why Iterative Decoding Works
Rüdiger Urbanke, Satish Babu Korada
We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given b ...
Institute of Electrical and Electronics Engineers2011Universal Rateless Codes From Coupled LT Codes
It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We study the performanc ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC
Rüdiger Urbanke, Shrinivas Kudekar
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 date, all of which s ...
IEEE2010Linear Universal Decoder for Compound Discrete Memoryless Channels
Shannon in his seminal work \cite{paper:shannon} formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity \textit{channel capacity} ...
2009Source and channel coding using Fountain codes
The invention of Fountain codes is a major advance in the field of error correcting codes. The goal of this work is to study and develop algorithms for source and channel coding using a family of Fountain codes known as Raptor codes. From an asymptotic poi ...
EPFL2009Polar codes for channel and source coding
The two central topics of information theory are the compression and the transmission of data. Shannon, in his seminal work, formalized both these problems and determined their fundamental limits. Since then the main goal of coding theory has been to find ...
EPFL2009Statistical physics methods for sparse graph codes
This thesis deals with the asymptotic analysis of coding systems based on sparse graph codes. The goal of this work is to analyze the decoder performance when transmitting over a general binary-input memoryless symmetric-output (BMS) channel. We consider t ...
EPFL2009Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes
Nicolas Macris, Shrinivas Kudekar
Consider communication over a binary-input memoryless output-symmetric channel with low density parity check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic formula for the aver ...
2009Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes
Nicolas Macris, Shrinivas Kudekar
Consider communication over a binary-input memoryless output-symmetric channel with low-density parity-check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic formula for the aver ...
2009Decay of Correlations: An Application to Low-Density Parity Check codes
Nicolas Macris, Shrinivas Kudekar
Recently the decay of correlations between bits of low density generator matrix (LDGM) codes have been investigated by using high temperature expansions from statistical physics \cite{KuMa07}. In this work we apply these ideas to a special class of low den ...
IEEE2008