Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 619-637

  Richardson, Thomas J ^a,b   Shokrollahi, M Amin ^a,d   Urbanke, Rüdiger L ^a,e  

^a LUCENT TECHNOLOGIES   (United States)

^b QUALCOMM INC   (United States)

^c EPFL   (Switzerland)

^d Digital Fountain Inc   (United States)

^e NONE

Author keywords

Belief propagation; Irregular low density parity check codes; Low density parity check codes; Turbo codes

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DECODING; GRAPH THEORY; ITERATIVE METHODS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; TURBO CODES;

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

ERROR CORRECTION;

EID: 0035246127     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910578     Document Type: Article

References (24)

1. The capacity of low-density parity-check codes under message-passing decoding
2. Practical loss-resilient codes
3. Linear-time encodeable and decodable error-correcting codes
4. Efficient encoding of low-density parity-check codes
5. A recursive approach to low complexity codes
6. Analysis of low density codes and improved designs using irregular graphs
7. Improved low-density parity-check codes using irregular graphs and belief propagation
8. Comparison of constructions of irregular Gallager codes
9. Analysis of random processes via and-or tree evaluation
10. Design of efficient erasure codes with differential evolution
11. Near Shannon limit error-correcting coding and decoding
12. Good error correcting codes based on very sparse matrices
13. New sequences of linear time erasure codes approaching the channel capacity
14. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
15. Capacity-achieving sequences
16. On the error-correcting capabilities of cycle codes of graphs
17. Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces
18. Practical loss-resilient codes