Finite-length analysis of low-density parity-check codes on the binary erasure channel

By Changyan Di, David Proietti, Emre Telatar, T. Richardson, Rüdiger L. Urbanke. IEEE Transactions on Information Theory, 2002

900 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/d7b24254af7dbed04b542142f1ee6c2542a9fb9f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images (2008, methodology): “To this aim, we adopt the topological definition of a stopping set, as proposed in [7].”
Using linear programming to Decode Binary linear codes (2005, background): “It is well known [3] that in the BEC, the iterative BP decoder fails if and only if a “stopping set” exists among the erased bits.”
Extrinsic information transfer functions: model and erasure channel properties (2004, background): “A common approach to enable analysis is to study ensembles of codes rather than specific codes [1]–[4], [50].”
LDPC block and convolutional codes based on circulant matrices (2004, background): “channel. Recently, Di et al. in [ 27 ] introduced the notion of a stopping set in a constraint graph.”
Regular and irregular progressive edge-growth tanner graphs (2005, methodology): “As observed in [ 21 ], the random ensemble average is to a large degree dominated by such “bad” graphs for short block lengths.”
Rate-adaptive codes for distributed source coding (2006, background): “The stopping number of a graph, the size of its smallest stopping set, affects the performance of iterative LDPC decoding on that graph [28]; the larger the stopping number is, the more likely it is that decoding will succeed.”
Selective avoidance of cycles in irregular LDPC code construction (2004, methodology): “[11] described stopping sets in the context of erasures.”
Channel Coding Rate in the Finite Blocklength Regime (2010, background): “The average block erasure probability for a random ensemble of linear codes is given in [38]; it can be shown that it is sandwiched between (183) and (184), which are also considerably easier to compute.”
Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA (2011, background): “In the LDPC codes context, a stopping set is any set of variable nodes such that any check node connected to this set is connected to it at least twice [27].”