Good error-correcting codes based on very sparse matrices

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1997, Pages 113-

  Mackay, David J C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ERROR CORRECTION; MATRIX ALGEBRA; OPTIMIZATION;

GAUSSIAN CHANNELS; LOW DENSITY PARITY CHECK CODES; SHANNON LIMIT;

CODES (SYMBOLS);

EID: 0030691310     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1997.613028     Document Type: Conference Paper

References (8)

1. R. G. Galfager, Low Density Parity Check Codes, Research monograph 21. hfIT Press, Cambridge, Mass., 1963.
2. D.J.C. MacKay and R. M. Neal, "Good codes based on very sparse matrices", in Cryptography and Coding. 5th IMA Conf., Colin Boyd, Ed., LNCS 1025, pp. 100-111. Springer, 1995.
3. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes", Electronics Letters, vol. 32, no. 18, pp. 1645-1646, August 1996, reprinted Electronics Letters, 13th March 1997.
4. D. J. C. MacKay, "Good error correcting codes based on very sparse matrices", available from http://wol.ra.phy. cam.ac.uk/, 1996.
5. M. C. Davey and D. J. C. MacKay, "Good codes over GF(q) based on very sparse matrices", in preparation, 1997.
6. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, 1988.
7. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes", in PI-oc. 1903 IEEE International Conference on Communica-tions, Geneva, Switzerland, 1993, pp. 1064-1070.
8. D. Divsilar and F. Pollara, "On the design of turbo codes", Tech. Rep. TDA 42-123, Jet Propulsion Laboratory, 1995.