The art of signaling: fifty years of coding theory
- 1 January 1998
- journal article
- review article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (6) , 2561-2595
- https://doi.org/10.1109/18.720549
Abstract
In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels, The coding theorem asserts that there are block codes with code rates arbitrarily close to channel capacity and probabilities of error arbitrarily close to zero. Fifty gears later, codes for the Gaussian channel have been discovered that come close to these fundamental limits. There is now a substantial algebraic theory of error-correcting codes with as many connections to mathematics as to engineering practice, and the last 20 years have seen the construction of algebraic-geometry codes that can be encoded and decoded in polynomial time, and that beat the Gilbert-Varshamov bound. Given the size of coding theory as a subject, this review is of necessity a personal perspective, and the focus is reliable communication, and not source coding or cryptography, The emphasis is on connecting coding theories for Hamming and Euclidean space and on future challenges, specifically in data networking, wireless communication, and quantum information theory.Keywords
This publication has 172 references indexed in Scilit:
- Quantum Analog of the MacWilliams Identities for Classical Coding TheoryPhysical Review Letters, 1997
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut boundInventiones Mathematicae, 1995
- Codes and iterative decoding on general graphsEuropean Transactions on Telecommunications, 1995
- A new procedure for decoding cyclic and BCH codes up to actual minimum distanceIEEE Transactions on Information Theory, 1994
- Error-locating pairs for cyclic codesIEEE Transactions on Information Theory, 1994
- Construction and decoding of a class of algebraic geometry codesIEEE Transactions on Information Theory, 1989
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972
- Sphere Packings and Error-Correcting CodesCanadian Journal of Mathematics, 1971
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962
- Encoding and error-correction procedures for the Bose-Chaudhuri codesIEEE Transactions on Information Theory, 1960