Asymptotic enumeration methods for analyzing LDPC codes

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 1115-1131

  Burshtein, David ^a   Miller, Gadi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Binary erasure channel (BEC); Code ensembles; Code spectrum; Iterative decoding; Low density parity check (LDPC) codes

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; GRAPH THEORY; POLYNOMIALS; PROBABILITY;

BINARY ERASURE CHANNEL; CODE ENSEMBLES; ITERATIVE DECODING; LOW-DENSITY PARITY-CHECK CODES;

CODES (SYMBOLS);

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

References (27)

1. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004. Also, available [Online] at http://www.stanford.edu/~boyd/cvxbook.html, to be published.
2. D. Burhstein and G. Miller, "Expander graph arguments for message passing algorithms," IEEE Trans. Inform. Theory, vol. 47, pp. 782-790, Feb. 2001.
3. ____, "Bounds on the performance of belief propagation decoding," IEEE Trans. Inform. Theory, vol. 48, pp. 112-122, Jan. 2002.
4. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
5. H. E. Daniels, "Saddlepoint approximations in statistics," Ann. Math. Statist., vol. 25, pp. 631-650, 1954.
6. C. Di, D. Proietti, I. E. Teletar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, June 2002.
7. C. Di, T. Richardson, and R. Urbanke, "Weight distribution of iterative coding systems: How deviant can you be?," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p. 50.
8. P. Flajolet and R. Sedgewick. (1994) The Average Case Analysis of Algorithms: Saddle Point Asymptotics. [Online]. Available: http://citeseer.nj.nec.com
9. ____, (1997) The Average Case Analysis of Algorithms: Multivariate Asymptotics and Limit Distributions. [Online]. Available: http://citeseer.nj.nec.com.
10. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
11. D. Gardy, "Some results on the asymptotic behavior of coefficients of large powers of functions," Discr. Math., vol. 139, pp. 189-217, 1995.
12. I. J. Good, "Saddle point methods for the multinomial distribution," Ann. Math. Statist., vol. 28, pp. 861-881, 1957.
13. W. K. Hayman, "A generalization of Stirling's formula," J. Reine Angew. Math., vol. 196, pp. 67-95, 1956.
14. S. Litsyn and V. Shevelev, "On ensembles of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inform. Theory, vol. 48, pp. 887-908, Apr. 2002.
15. ____, "Distance distributions in ensembles of irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 49, pp. 3140-3159, Dec. 2003.
16. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 569-584, Feb. 2001.
17. ____, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, Feb. 2001.
18. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2696-2710, Nov. 2001.
19. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994.
20. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
21. ____, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 638-656, Feb. 2001.
22. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
23. I. Sason and S. Shimai (Shitz), "On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2275-2299, Sept. 2001.
24. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (Lecture Notes in Computer Science), M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
25. N. Shulman and M. Feder, "Random coding techniques for nonrandom codes," IEEE Trans. Inform. Theory, vol. 45, pp. 2101-2104, Sept. 1999.
26. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1723, Nov. 1996.
27. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.