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:

    Social history might be defined negatively as the history of a people with the politics left out.
    —G.M. (George Macaulay)

    What we call National-Socialism is the poisonous perversion of ideas which have a long history in German intellectual life.
    Thomas Mann (1875–1955)

    History has neither the venerableness of antiquity, nor the freshness of the modern. It does as if it would go to the beginning of things, which natural history might with reason assume to do; but consider the Universal History, and then tell us,—when did burdock and plantain sprout first?
    Henry David Thoreau (1817–1862)