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:

    The greatest honor history can bestow is that of peacemaker.
    Richard M. Nixon (1913–1995)

    Let us not underrate the value of a fact; it will one day flower in a truth. It is astonishing how few facts of importance are added in a century to the natural history of any animal. The natural history of man himself is still being gradually written.
    Henry David Thoreau (1817–1862)

    Yet poetry, though the last and finest result, is a natural fruit. As naturally as the oak bears an acorn, and the vine a gourd, man bears a poem, either spoken or done. It is the chief and most memorable success, for history is but a prose narrative of poetic deeds.
    Henry David Thoreau (1817–1862)