Abstract
Consider an information source whose outputs are independent identically distributed random variables (i.i.d. r.v.s) taking values in the finite set or alphabet Jc = {0, 1,..., c−1}; a coding alphabet Jd = {0, 1,..., d−1}; and a noiseless transmission medium, or channel, that accepts letters from Jd as inputs and delivers them to the destination without any change (see figure 1).
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
Jelinek, F.: Probabilistic Information Theory, McGraw-Hill, 1968.
Jelinek, F.: “Buffer Overflow in Variable Length Coding of Fixed Rate Sources”, IEEE Trans. Inform. Theory, IT-14(3), May 1968.
Kraft, L.G.: “A Device for Quantizing, Grouping and Coding Amplitude Modulated Pulses”, M.S. thesis, Dept. of Elec. Engin., M.I.T., 1949.
Huffman, D.A.: “A Method of Construction of Minimum Redundancy Codes”, Proc. IRE, 40 (10), Sept. 1962.
Gallager, R.G.: Information Theory and Reliable Communication, J. Wiley and Sons, 1968.
Tunstall, A.: “Synthesis of Noiseless Compression Codes”, Ph.D. dissertation, Georgia Inst. Technol., Atlanta, 1968.
Shannon, C.E.: “A Mathematical Theory of Communication”, Bell Systems Tech.J., 27, p. 379 and 623, 1948.
Longo, G.: “Source Coding Theory” CISM Courses and Lectures, No. 32, Springer, 1970.
Elias, P.: unpublished result.
Schalkwijk, J.P.: “An Algorithm for Source Coding”, IEEE Trans. Inform. Theory, IT-18(3), May 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Wien
About this chapter
Cite this chapter
Jelinek, F., Longo, G. (1975). Algorithms for Source Coding. In: Longo, G. (eds) Coding and Complexity. International Centre for Mechanical Sciences, vol 216. Springer, Vienna. https://doi.org/10.1007/978-3-7091-3008-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-7091-3008-7_9
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81341-6
Online ISBN: 978-3-7091-3008-7
eBook Packages: Springer Book Archive