Audio Coding pp 161-170 | Cite as

Huffman Coding

  • Yuli You


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.


Entropy Assure Acoustics 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 29s.
    Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proceedings of the I.R.E. pp. 1098–1102 (1952)Google Scholar

Copyright information

© Springer US 2010

Authors and Affiliations

  • Yuli You
    • 1
  1. 1.University of Minnesota in Twin CitiesMinneapolisUSA

Personalised recommendations