Stopping set distribution of LDPC code ensembles

IEEE Transactions on Information Theory

Volumn 51, Issue 3, 2005, Pages 929-953

  Orlitsky, Alon ^a   Viswanathan, Krishnamurthy ^a   Zhang, Junan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Binary erasure channel (BEC); Block error probability; Growth rate; Low density parity check (LDPC) codes; Minimum distance; Stopping set

Indexed keywords

CODES (SYMBOLS); DECODING; ERROR ANALYSIS; GRAPH THEORY; ITERATIVE METHODS; MARKOV PROCESSES; POLYNOMIALS; PROBABILITY; THEOREM PROVING;

BINARY ERASURE CHANNEL (BEC); BLOCK ERROR PROBABILITY; GROWTH RATE; LOW DENSITY PARITY CHECK (LDPC) CODES; MINIMUM DISTANCE; STOPPING SET; TANNER GRAPH;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (17)

1. R. G. Gallager, Low-Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. M. G. Luby, M. Mitzemacher, M. A. Shokrollahi, and D. A. Spielman, "Efficeint erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
3. T. J. Richarson and R. L. Urbanke, "Efficient encoding of low density parity check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
4. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
5. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
6. T. J. Richarson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
7. J. Zhang and A. Orlitsky, "Finite length analysis of LDPC codes with lareg left degrees," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 3.
8. C. Di, R. Urbanke, and T. Richardson, "Weight distribution: How deviant can you be?," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 50.
9. C. Di, "Weight distribution of low-density parity-check codes," IEEE Trans. Inf. Theory, submitted for publication.
10. 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.
11. S. Litsyn, "Distance distributions in ensembles of irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3140-3159, Dec. 2003.
12. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing LDPC codes," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1115-1131, Jun. 2004.
13. T. J. Richarson, M. A. Shokrollahi, and R. L. Urbanke, "Finite length analysis of varous low-density parity-check ensembles for the binary erasure channel," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 1.
14. W. Rudin, Principles of Mathematical Analysis. New York: McGraw-Hill, 1976.
15. C. Di, A. Montanari, and R. Urbanke, "Weight distribtution of LDPC code ensembles: Combinatorics meets statistical physics," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 102.
16. A. Shwartz and A. Weiss, Large Deviations for Perfomrnace Analysis London, U.K.: Chapman & Hall, 1995.
17. T. J. Richarson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.