Good codes based on very sparse matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1025, Issue , 1995, Pages 100-111

  Mackay, David J C ^a   Neal, Radford M ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; FORWARD ERROR CORRECTION; FREE ENERGY;

BELIEF PROPAGATION ALGORITHM; BINARY SYMMETRIC CHANNEL; ERROR CORRECTING CODE; FREE ENERGY MINIMIZATION; INFORMATION RATES; INVERTIBLE MATRICES; REED-MULLER CODES; SPARSE MATRICES;

DECODING;

EID: 84947903359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60693-9_13     Document Type: Conference Paper

References (16)

1. S. Andreassen, M. Woldbye, B. Falck, and S. Andersen. MUNIN-a causal probabilistic network for the interpretation of electromyographic findings. In Proc. of the 10th National Conf. on AI, AAAI: Menlo Park CA., pages 121-123, 1987.
2. E. R. Berlekamp. Algebraic Coding Theory. McGraw-Hill, New York, 1968.
3. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, New York, 1991.
4. R. G. Gallager. Low density parity check codes. IRE Trans. Info. Theory, IT-8:21-28, Jan 1962.
5. D. J. C. MacKay. Free energy minimization algorithm for decoding and cryptanalysis. Electronics Letters, 31(6):446-447, 1995.
6. D. J. C. MacKay and R. M. Neal. Good codes based on very sparse matrices. Available from http://131.111.48.24/, 1995.
7. F. J. MacWilliams and N. J. A. Sloane. The theory of error-correcting codes. North-Holland, Amsterdam, 1977.
8. R. J. McEliece. The theory of information and coding: a mathematical framework for communication. Addison-Wesley, Reading, Mass., 1977.
9. W. Meier and O. StafFelbach. Fast correlation attacks on certain stream ciphers. J. Cryptology, 1:159-176, 1989.
10. M. J. Mihaljević and J. D. Golić. Convergence of a Bayesian iterative error-correction procedure on a noisy shift register sequence. In Advances in Cryptology-EUROCRYPT 92, volume 658, pages 124-137. Springer-Verlag, 1993.
11. J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Mateo, 1988.
12. W. W. Peterson and E. J. Weldon, Jr. Error-Correcting Codes. MIT Press, Cambridge, Massachusetts, 2nd edition, 1972.
13. J. Rissanen and G. G. Langdon. Arithmetic coding. IBM Journal of Research and Development, 23:149-162, 1979.
14. C. E. Shannon. A mathematical theory of communication. Bell Sys. Tech. J., 27:379-423, 623-656, 1948.
15. M. A. Tsfasman. Algebraic-geometric codes and asymptotic problems. Discrete Applied Mathematics, 33(1-3):241-256, 1991.
16. I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, 1987.