The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 599-618

  Richardson, Thomas J ^a,b   Urbanke, Rüdiger L ^a,c  

^a LUCENT TECHNOLOGIES   (United States)

^b QUALCOMM INC   (United States)

^c EPFL   (Switzerland)

Author keywords

Belief propagation; Iterative decoding; Low density parity check (LDPC) codes; Message passing decoders; Turbo codes; Turbo decoding

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; DECODING; ITERATIVE METHODS; TURBO CODES;

BELIEF PROPAGATION; LOW-DENSITY PARITY-CHECK (LDPC) CODES;

ERROR CORRECTION;

EID: 0035246307     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910577     Document Type: Article

References (20)

1. Near Shannon limit error-correcting coding and decoding
2. Good error correcting codes based on very sparse matrices
3. Expander codes
4. Estimation of the error-correction complexity of Gallager low-density codes
5. A recursive approach to low complexity codes
6. Explicit construction of graphs without short cycles and low density codes
7. Comparison of constructions of irregular Gallager codes
8. Design of capacity-approaching irregular low-density parity-check codes
9. Low density parity check codes over GF (q)
10. Exact thresholds for the binary symmetric channel and Gallager's decoding algorithm A
11. A note on low density parity check codes for erasures and errors
12. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
13. Randomized Algorithms
14. Understanding serially concatenated codes from a support tree approach
15. A Viterbi algorithm with soft-decision outputs and its applications