Weight distribution of low-density parity-check codes

IEEE Transactions on Information Theory

Volumn 52, Issue 11, 2006, Pages 4839-4855

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

^a EPFL   (Switzerland)

^b GERMAN AEROSPACE CENTER DLR   (Germany)

^c QUALCOMM INC   (United States)

Author keywords

Binary erasure channel (BEC); Capacity achieving sequences; Growth rate; Irregular repeat accumulate (IRA) codes; Low density parity check (LDPC) codes; Minimum distance; Weight distribution

Indexed keywords

BINARY CODES; CODES (SYMBOLS); DECODING;

BINARY ERASURE CHANNEL; CAPACITY-ACHIEVING SEQUENCES; GROWTH RATE; IRREGULAR REPEAT-ACCUMULATE CODE; LOW-DENSITY PARITY-CHECK CODES; MINIMUM DISTANCE; WEIGHT DISTRIBUTION;

INFORMATION THEORY;

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

References (27)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
3. G. Miller and D. Burshtein, "Bounds on the maximum likelihood decoding error probability of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2696-2710, Nov. 2001.
4. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1284-1292, Jul. 1994.
5. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Efficient erasure codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
6. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
7. T. Richardson and R. Urbanke, "An introduction to the analysis of iterative coding systems," in Codes, Systems, and Graphical Models, ser. IMA Math. and its Appl, B. Marcus and J. Rosenthal, Eds. New York: Springer, 2000, pp. 1-37.
8. A. Shokrollahi, "Capacity-achieving sequences," in Codes, Systems, and Graphical Models, ser. IMA Math. and its Appl, B. Marcus and J. Rosenthal, Eds. New York: Springer, 2000, pp. 153-166.
9. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 929-953, Mar. 2005.
10. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of provably good low-density parity check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
11. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. AAECC-13 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
12. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
13. L. M. Bazzi, "Minimum Distance of Error Correcting Codes Versus Encoding Complexity, Symmetry, and Pseudorandomness," Ph.D. dissertation, MIT, Cambridge, MA, 2003.
14. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding," in Proc. Int. Conf. Communication (ICC'93), Geneva, Switzerland, May 1993, pp. 1064-1070.
15. D. Divsalar, H. Jin, and R. McEliece, "Turbo-Like Codes," in Proc. 36th Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 1998, pp. 201-210.
16. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proce. 2nd Int. Symp. Turbo codes and Related Topics, Paris, France, Sep. 2000, pp. 1-8.
17. S. Litsyn and V. Shevelev, "On ensembles of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inf. Theory, vol. 48, no. 4, pp. 887-908, Apr. 2002.
18. C. Di, T. Richardson, and R. Urbanke, "Weight distribution of iterative coding systems: How deviant can you be?," in Proc. IEEE Inte. Symp. Information Theory, Washington, DC, Jun. 2001, p. 50.
19. S. L. Litsyn and V. Shevelev, "Distance distribution in ensembles of irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3140-3159, Dec. 2003.
20. G. Miller and D. Burshtein, "Asymptotic enumeration method for analyzing LDPC codes," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1115-1131, Jun. 2004.
21. H. S. Wilf, Generatingfunctionology. San Diego, CA: Academic, 1994.
22. I. Sason, I.E. Telatar, and R. Urbanke, "On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3052-3061, Dec. 2002.
23. C. Di, A. Montanari, and R. Urbanke, "Weight distribution of LDPC codes: Combinatorics meets statistical physics," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 102.
24. B. Bollobás, Random Graphs, ser. Cambridge Studies in Advanced Mathematics. Cambridge, U.K.: Cambridge Univ. Press, 2001.
25. A. Khandekar, "Graph Based Codes and Iterative Decoding," Ph.D. dissertation, California Inst. Technol., Pasadena, CA, 2002.
26. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics. Reading, MA: Addison-Wesley, 1994.
27. E. Bender and L. B. Richmond, "Central and local limit theorems applied to asymptotic enumeration ii: Multivariate generating functions," J. Combin. Theory Ser. A, vol. 34, no. 3, pp. 255-265, 1983.