Exact thresholds and optimal codes for the binary-symmetric channel and Gallager's decoding algorithm A

IEEE Transactions on Information Theory

Volumn 50, Issue 9, 2004, Pages 2010-2021

  Bazzi, Louay ^a   Richardson, Thomas J ^b   Urbanke, Rüdiger L ^c  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

^b QUALCOMM INC   (United States)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); OPTIMIZATION; POLYNOMIALS; TURBO CODES;

BINARY SYMMETRIC CHANNEL; GALLAGER DECODING ALGORITHM; LOW DENSITY PARITY CHECK CODES; OPTIMAL CODES;

DECODING;

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

References (9)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. D. J. C. MacKay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
3. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 29th annual ACM Symp. Theory of Computing, 1997, pp. 150-159.
4. 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-619, Feb. 2001.
5. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity approaching low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 599-619, Feb. 2001.
6. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kanfmann, 1988.
7. R. Descartes,. "Geometrie 1636," in A Source Book in Mathematics. Cambridge, MA: Harvard Univ. Press, 1969.
8. P. Henrici, Applied and Computational Complex Analysis. New York: Wiley, 1974, vol. 1.
9. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.