Adaptive Information Processing pp 16-24 | Cite as
Coding information
Chapter
Abstract
The creation of efficient and reliable codes was a major reason for the development of communication theory and remains one of its principal applications. The theorems of Shannon, with which we closed the last chapter, tell us that coding schemes exist which guarantee optimum transmission rates or minimum error frequencies, but not what those schemes might be. In this chapter we examine some aspects of the coding problem.
Keywords
Binary Code Code Word Code Symbol Binary Encode Single Error
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Bibliography
- Abramson, Norman. Information Theory and Coding. McGraw-Hill, 1963. An excellent little book on both subjects. Coding is covered primarily in Chapters 3, 4, and 6.Google Scholar
- Berlekamp, Elwyn R. Algebraic Coding Theory. McGraw-Hill, 1968. An advanced text on the mathematical foundations of coding theory.MATHGoogle Scholar
- Hamming, R. W. “Error-detecting and error-correcting codes.” Bell System Technical Journal, 29, 1950, pp. 147–150. The original paper on Hamming codes.MathSciNetGoogle Scholar
- Huffman, D. A. “A method for the construction of minimum redundancy codes.” Proceedings of the Institute of Radio Engineers, 40, 1952, pp. 1098–1101. The original paper on Huffman codes.Google Scholar
- Singh, Jagjit. Great Ideas in Information Theory, Language, and Cybernetics. Dover, 1966.MATHGoogle Scholar
Copyright information
© Springer-Verlag New York Inc. 1976