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 years 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
Affiliated Institutions
Related Publications
The minimum distance problem for two-way entanglement purification
Entanglement purification takes a number of noisy EPR pairs and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical ...
Low-Density Parity-Check Codes
This is a complete presentation of all important theoretical and experimental work done on low-density codes. Low-density coding is one of the three techniques thus far develope...
Class of quantum error-correcting codes saturating the quantum Hamming bound
I develop methods for analyzing quantum error-correcting codes, and use these\nmethods to construct an infinite class of codes saturating the quantum Hamming\nbound. These codes...
Good error-correcting codes based on very sparse matrices
We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay-Neal (1995)) codes are recently invented, and "Gallager codes" were first ...
A recursive approach to low complexity codes
A method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is sh...
Publication Info
- Year
- 1998
- Type
- article
- Volume
- 44
- Issue
- 6
- Pages
- 2561-2595
- Citations
- 64
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/18.720549