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:

    Books of natural history aim commonly to be hasty schedules, or inventories of God’s property, by some clerk. They do not in the least teach the divine view of nature, but the popular view, or rather the popular method of studying nature, and make haste to conduct the persevering pupil only into that dilemma where the professors always dwell.
    Henry David Thoreau (1817–1862)

    The history of the Victorian Age will never be written: we know too much about it.
    Lytton Strachey (1880–1932)

    Indeed, the Englishman’s history of New England commences only when it ceases to be New France.
    Henry David Thoreau (1817–1862)