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 , developed by David A. Huffman in 1952 when he was a Ph.D. student at MIT, is just such a simple algorithm.
KeywordsInternal Node Huffman Code Codeword Length Decodable Code Probable Symbol
Unable to display preview. Download preview PDF.
- 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