Abstract
We present a new family of error-correcting codes for the binary symmetric channel. These codes are designed to encode a sparse source, and are defined in terms of very sparse invertible matrices, in such a way that the decoder can treat the signal and the noise symmetrically. The decoding problem involves only very sparse matrices and sparse vectors, and so is a promising candidate for practical decoding.
It can be proved that these codes are ‘very good’, in that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit.
We give experimental results using a free energy minimization algorithm and a belief propagation algorithm for decoding, demonstrating practical performance superior to that of both Bose-Chaudhury-Hocquenghem codes and Reed-Muller codes over a wide range of noise levels.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
E. R. Berlekamp. Algebraic Coding Theory. McGraw-Hill, New York, 1968.
T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, New York, 1991.
R. G. Gallager. Low density parity check codes. IRE Trans. Info. Theory, IT-8:21–28, Jan 1962.
D. J. C. MacKay. Free energy minimization algorithm for decoding and cryptanalysis. Electronics Letters, 31(6):446–447, 1995.
D. J. C. MacKay and R. M. Neal. Good codes based on very sparse matrices. Available from http://131.111.48.24/, 1995.
F. J. MacWilliams and N. J. A. Sloane. The theory of error-correcting codes. North-Holland, Amsterdam, 1977.
R. J. McEliece. The theory of information and coding: a mathematical framework for communication. Addison-Wesley, Reading, Mass., 1977.
W. Meier and O. Staffelbach. Fast correlation attacks on certain stream ciphers. J. Cryptology, 1:159–176, 1989.
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.
J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Mateo, 1988.
W. W. Peterson and E. J. Weldon, Jr. Error-Correcting Codes. MIT Press, Cambridge, Massachusetts, 2nd edition, 1972.
J. Rissanen and G. G. Langdon. Arithmetic coding. IBM Journal of Research and Development, 23:149–162, 1979.
C. E. Shannon. A mathematical theory of communication. Bell Sys. Tech. J., 27:379–423, 623–656, 1948.
M. A. Tsfasman. Algebraic-geometric codes and asymptotic problems. Discrete Applied Mathematics, 33(1–3):241–256, 1991.
I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520–540, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
MacKay, D.J.C., Neal, R.M. (1995). Good codes based on very sparse matrices. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-60693-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60693-2
Online ISBN: 978-3-540-49280-1
eBook Packages: Springer Book Archive