Huffman Coding - History

History

In 1951, David A. Huffman and his MIT information theory classmates were given the choice of a term paper or a final exam. The professor, Robert M. Fano, assigned a term paper on the problem of finding the most efficient binary code. Huffman, unable to prove any codes were the most efficient, was about to give up and start studying for the final when he hit upon the idea of using a frequency-sorted binary tree and quickly proved this method the most efficient.

In doing so, the student outdid his professor, who had worked with information theory inventor Claude Shannon to develop a similar code. Huffman avoided the major flaw of the suboptimal Shannon-Fano coding by building the tree from the bottom up instead of from the top down.

Read more about this topic:  Huffman Coding

Famous quotes containing the word history:

    “What would we not give for some great poem to read now, which would be in harmony with the scenery,—for if men read aright, methinks they would never read anything but poems. No history nor philosophy can supply their place.”
    —Henry David Thoreau (1817–1862)

    “When the history of guilt is written, parents who refuse their children money will be right up there in the Top Ten.”
    —Erma Brombeck (20th century)

    “If you look at the 150 years of modern China’s history since the Opium Wars, then you can’t avoid the conclusion that the last 15 years are the best 15 years in China’s modern history.”
    —J. Stapleton Roy (b. 1935)