Abstract
Now that we are assured that, given a probability distribution, if there is an optimal uniquely decodable code, there is a prefix-free code with the same average codeword length, the next step is the construction of such optimal prefix-free codes. Huffman’s algorithm [29], developed by David A. Huffman in 1952 when he was a Ph.D. student at MIT, is just such a simple algorithm.
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
Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proceedings of the I.R.E. pp. 1098–1102 (1952)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer US
About this chapter
Cite this chapter
You, Y. (2010). Huffman Coding. In: Audio Coding. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1754-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1754-6_9
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1753-9
Online ISBN: 978-1-4419-1754-6
eBook Packages: EngineeringEngineering (R0)