Improved low-density parity-check codes using irregular graphs

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 585-598

  Luby, Michael G ^a,b,c   Mitzenmacher, Michael ^c,d   Shokrollahi, M Amin ^a,b,c   Spielman, Daniel A ^e  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

^c Digital Fountain Inc   (United States)

^d HARVARD UNIVERSITY   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Belief propagation; Concentration theorem; Gallager codes; Irregular codes; Low density parity check codes

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DECISION THEORY; DECODING; ERROR CORRECTION; GAUSSIAN NOISE (ELECTRONIC); GRAPH THEORY;

BELIEF PROPAGATION; GALLAGER CODES; LOW-DENSITY PARITY-CHECK CODES;

CODES (SYMBOLS);

EID: 0035246580     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910576     Document Type: Article

References (28)

1. Near Shannon limit error-correcting coding and decoding: Turbo-codes
2. Expander graph arguments for message passing algorithms
3. Some high-rate near capacity codecs for the Gaussian channel
4. Low-density parity-check codes over GF (q)
5. On the design of turbo codes
6. The forward-backward algorithm
7. Decoding of low-density codes
8. Iterative decoding of compound codes by probability propagation in graphical models
9. Practical loss-resilient codes
10. Analysis of random processes via and-or trees
11. Improved low-density parity-check codes using irregular graphs and belief propagation
12. Analysis of low-density codes and improved designs using irregular graphs
13. Turbo coding as an instance of Pearl's 'belief propagation' algorithm
14. Good error correcting codes based on very sparse matrices
15. Near Shannon limit performance of low-density parity-check codes
16. Design of capacity-approaching low-density parity-check codes
17. The capacity of low-density parity-check codes under message-passing decoding
18. Expander codes
19. Linear time encodable and decodable error-correcting codes
20. Codes and iterative decoding on general graphs
21. Estimation of the error-correction complexity of Gallager low-density codes (in Russia)
22. Efficient erasure correcting codes