Parity-check density versus performance of binary linear block codes over memoryless symmetric channels

IEEE Transactions on Information Theory

Volumn 49, Issue 7, 2003, Pages 1611-1635

  Sason, Igal ^a   Urbanke, Rüdiger ^a  

^a EPFL   (Switzerland)

Author keywords

Bipartite graph; Block codes; Channel capacity; Cycles in a graph; Error probability; Iterative decoding; Linear codes; Low density parity check (LDPC) codes; Maximum likelihood (ML) decoding; Memoryless channels; Sparse matrices

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BINARY CODES; BOUNDARY CONDITIONS; CHANNEL CAPACITY; DECODING; ERROR CORRECTION; ITERATIVE METHODS; LINEARIZATION; MATRIX ALGEBRA; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

BIPARTITE GRAPH; ITERATIVE DECODING; LINEAR CODES; LOW DENSITY PARITY CHECK CODES; MAXIMUM LIKELIHOOD DECODING; MEMORYLESS BINARY INPUT OUTPUT SYMMETRIC CHANNELS; PARITY CHECK MATRIX;

BLOCK CODES;

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

References (27)

1. O. Barak, D. Burshtein, and M. Feder, "Bounds on achievable rates of LDPC codes used over the binary erasure channel," IEEE Trans. Inform. Theory, submitted for publication.
2. A. Barg and G. Zémor, "Error exponents of expander codes," IEEE Trans. Inform. Theory, vol. 48, pp. 1725-1729, June 2002.
3. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. IT-24, pp. 384-386, May 1978.
4. D. Burshtein, M. Krivelevich, S. Litsyn, and G. Miller, "Upper bounds on the rate of LDPC codes," IEEE Trans. Inform. Theory, vol. 48, pp. 2437-2449, Sept. 2002.
5. C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, June 2002.
6. T. Etzion, A. Trachtenberg, and A. Vardy, "Which codes have cycle-free Tanner graphs?," IEEE Trans. Inform. Theory, vol. 45, pp. 2173-2181, Sept. 1999.
7. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963. [Online]. Available:http://lthiwww.epfl.ch/~eeigal/Gallager_monograph.ps.
8. J. Gross and J. Yellen, Graph Theory and Its Applications. Boca Raton, FL: CRC, 1999.
9. H. Jin and R. J. McEliece, "Typical pairs decoding on the AWGN channel," in Proc. 2000 Int. Symp. Information Theory and Its Applications, Honolulu, HI, Nov. 5-8, 2000, pp. 180-183.
10. A. Khandekar and R. J. McEliece, "On the complexity of reliable communication on the erasure channel," in Proc. IEEE Int. Symp. Information Theory (ISIT2001), Washington, D.C., June 2001, p. 1.
11. A. Khandekar, "Graph-based codes and iterative decoding," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, CA, June 2002. [Online]. Available: http://etd.caltech.edu/etd/available/etd-06202002-170522/.
12. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. on Information Theory, vol. 47, pp. 569-584, Feb. 2001.
13. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Information Theory, vol. 45, pp. 399-431, Mar. 1999.
14. S. J. MacMullan and O. M. Collins, "The capacity of binary channels that use linear codes and decoders," IEEE Trans. Inform. Theory, vol. 44, pp. 197-214, Jan. 1998.
15. R. J. McEliece, "Achieving the Shannon limit: A progress report," Plenary talk given at the 38th Annual Allerton Conf. Communication, Control and Computing, Allerton, IL, Oct. 5, 2000. [Online]. Available:http://www.systems.caltech.edu/EE/Faculty/rjm.
16. 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.
17. P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 3017-3028, Dec. 2002.
18. 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.
19. 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.
20. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 638-656, Feb. 2001.
21. T. Richardson, A. Shokrollahi, and R. Urbanke, "Error floor analysis of various low-density parity-check ensembles for the binary erasure channel," in preparation.
22. I. Sason and S. Shamai (Shitz), "Improved upper bounds on the ensemble performance of ML decoded low-density parity-check codes," IEEE Commun. Lett., vol. 4, pp. 89-91, Mar. 2000.
23. S. Shamai (Shitz) and I. Sason, "Variations on the Gallager bounds, connections and applications," IEEE Trans. Inform. Theory, vol. 48, pp. 3029-3051, Dec. 2002.
24. A. Shokrollahi, "New sequences of time erasure codes approaching channel capacity," in Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Lectures Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
25. ____, "Capacity-achieving sequences," in IMA Volumes in Mathematics and Its Applications, 2001, vol. 123, pp. 153-166.
26. N. Shulman and M. Feder, "Random coding techniques for nonrandom codes," IEEE Trans. Inform. Theory, vol. 45, pp. 2101-2104, Sept. 1999.
27. The Lambert W-function. [Online]. Available:http://mathworld.wolfram.com/LambertsW-Function.html.