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

IEEE Transactions on Information Theory

Volumn 48, Issue 6, 2002, Pages 1570-1579

  Di, Changyan ^a,b   Proietti, David ^b   Telatar, I Emre ^b   Richardson, Thomas J ^c   Urbanke, Rüdiger L ^b  

^a IEEE   (Switzerland)

^b EPFL   (Switzerland)

^c QUALCOMM INC   (United States)

Author keywords

Belief propagation; Binary erasure channel (BEC); Finite length analysis; Low density parity check (LDPC) codes

Indexed keywords

LOW DENSITY PARITY CHECK (LDPC) CODES;

CODES (SYMBOLS); DECODING; ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0036612281     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.1003839     Document Type: Article

References (16)

1. Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A
2. Coding theorems for "turbo-like" codes
3. Low-density parity-check codes
4. Analysis of low density codes and improved designs using irregular graphs
5. Improved low-density parity-check codes using irregular graphs and belief propagation
6. Practical loss-resilient codes
7. Good error correcting codes based on very sparse matrices
8. Design of capacity approaching irregular low-density parity check codes
9. Error floor analysis of various low-density parity-check ensembles for the binary erasure channel
10. The capacity of low-density parity check codes under message-passing decoding
11. Efficient encoding of low density parity check codes
12. New sequences of linear time erasure codes approaching the channel capacity
13. Capacity-achieving sequences
14. Design of efficient erasure codes with differential evolution
15. Finite length analysis of LDPC codes with large left degrees