Abstract
Before architecture of a data communications network is started, there are a number of preparatory steps. One of these is to understand, characterize, and appropriately model the data source. Is it English text? A Markov source? Facsimile? Each source is unique and so are its output statistics. There is often great opportunity to remove redundancy from a source by using simple encoding methods and doing so may result in an appreciable savings in bits sent.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramson, N. (1963), Information Theory and Coding, McGraw-Hill, New York.
Connell, J. (1973), A Huffman-Shannon-Fano Code, Proceedings of the IEEE, pp. 1046–1047.
Cover, T. (1973), Enumerative Source Coding, IEEE Transactions on Information Theory, Vol. 19, pp. 73 - 77.
Eastman, W. (1965), On the Construction of Comma-Free Codes, IEEE Transactions on Information Theory, Vol. 11, pp. 135–142.
Even, S. (1963), Tests for Unique Decipherability, IEEE Transactions on Information Theory, Vol. 9, pp. 109–112.
Golomb, S., B. Gordon, and L. Welch (1958), Comma-Free Codes, Canadian Journal of Mathematics, Vol. 10, pp. 202–209.
Hankamer, M. (1979), A Modified Huffman Procedure with Reduced Memory Requirement, IEEE Transactions on Communications, Vol. 27, pp. 930–932.
Huffman, D. (1952), A Method for the Construction of Minimum Redundancy Codes, Proceedings of the IRE, pp. 1098–1101.
Karush, J. (1961), A Simple Proof of an Inequality of McMillan, IRE Transactions on Information Theory, Vol. 7, p. 118.
McMillan, B. (1956), Two Inequalities Implied by Unique Decipherability, IRE Transactions on Information Theory, Vol. 2, pp. 115–116.
Ohnishi, R., Y. Ueno, and F. Ono (1977a), Optimization of Facsimile Data Compression, National Telecommunications Conference Record, pp. 49.1.1–49. 1. 6.
Ohnishi, R., Y. Ueno, and F. Ono (1977b), Efficient Coding for Binary Information Sources, Transactions IECE, Japan, Vol. 60-A, No. 12.
Raisbeck, G. (1963), Information Theory, The MIT Press, Cambridge, MA.
Reza, F. (1961), An Introduction to Information Theory, McGraw-Hill, New York.
Scholtz, R. (1966), Codes with Synchronization Capability, IEEE Transactions on Information Theory, Vol. 12, pp. 135–142.
Tanaka, H. and A. Leon-Garcia (1982), Efficient Run-Length Encodings, IEEE Transactions on Information Theory, Vol. 28, pp. 880–890.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Plenum Press, New York
About this chapter
Cite this chapter
Hershey, J.E., Rao Yarlagadda, R.K. (1986). Source Encoding. In: Data Transportation and Protection. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2195-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2195-8_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9290-6
Online ISBN: 978-1-4613-2195-8
eBook Packages: Springer Book Archive