The renaissance of Gallager's low-density parity-check codes

IEEE Communications Magazine

Volumn 41, Issue 8, 2003, Pages 126-131

  Richardson, Tom ^b   Urbanke, Rüdiger ^a  

^a EPFL   (Switzerland)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; ERROR CORRECTION; SIGNAL ENCODING;

BELIEF PROPAGATION; ERROR CORRECTING CODING; ITERATIVE ALGORITHMS; LOW DENSITY PARITY CHECK CODES;

TURBO CODES;

EID: 0041919281     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCOM.2003.1222728     Document Type: Article

References (15)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon Limit Error-Correcting Coding and Decoding," Proc. ICC '93, Geneva, Switzerland, May 1993, pp. 1064-70.
2. D. J. C. MacKay and R. M. Neal, "Good Codes Based on Very Sparse Matrices," Cryptography and Coding. 5th IMA Conf. C. Boyd, Ed., LNCS, no. 1025, Berlin: Springer, 1995, pp. 100-11.
3. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. thesis, Linköping Unive., S-581 83, Linköping, Sweden, 1996.
4. R. Gallager, "Low-Density Parity-Check Codes," IRE Trans. Info. Theory, vol. 7, Jan. 1962, pp. 21-28.
5. T. Richardson and R. Urbanke, "The Capacity of Low-Density Parity Check Codes Under Message-Passing Decoding," IEEE Trans. Info. Theory, vol. 47, Feb. 2001, pp. 599-618.
6. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes," IEEE Trans. Info. Theory, vol. 47, Feb. 2001, pp. 619-37.
7. S. Chung et al., "On the Design of Low-Density Parity-Check Codes Within 0.0045 db of the Shannon Limit," IEEE Commun. Lett., vol. 5, Feb. 2001, pp. 58-60.
8. F. Kschischang, B. Frey, and H.-A. Loeliger, "Factor Graphs and the Sum-Product Algorithm," IEEE Trans. Info. Theory, vol. 47, Feb. 2001, pp. 498-519.
9. A. Khandekar and R. J. McEliece, "On the Complexity of Reliable Communication on the Erasure Channel," Proc. Int'l. Symp. Info. Theory, Washington, DC, 2001, p. 1.
10. V. Zyablov and M. Pinsker, "Estimation of the Error-Correction Complexity of Gallager Low-Density Codes," Problemy Peredachi Informatsii, vol. 11, Jan. 1975, pp. 23-26.
11. M. Sipser and D. Spielman, "Expander Codes," IEEE Trans. Info. Theory, vol. 42, Nov. 1996, pp. 1710-22.
12. T. Richardson and R. Urbanke, "Efficient Encoding of Low-Density Parity-Check Codes," IEEE Trans. Info. Theory, vol. 47, Feb. 2001, pp. 638-56.
13. D. Divsalar, H. Jin, and R. McEliece, "Coding Theorems for 'Turbo-Like' Codes," Proc. 1998 Allerton Conf., 1998, pp. 201-10.
14. J. Hu et al., "A General Class of LDPC Finite Geometry Codes and Their Performance," IEEE Int'l. Symp. Info. Theory, Lausanne, Switzerland, June 30-July 5, 2002, p. 309.
15. M. Luby et al., "Efficient Erasure Correcting Codes," IEEE Trans. Info. Theory, vol. 47, Feb. 2001, pp. 569-84.