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:

    It takes a great deal of history to produce a little literature.
    Henry James (1843–1916)

    The history of mankind interests us only as it exhibits a steady gain of truth and right, in the incessant conflict which it records between the material and the moral nature.
    Ralph Waldo Emerson (1803–1882)

    It’s a very delicate surgical operation—to cut out the heart without killing the patient. The history of our country, however, is a very tough old patient, and we’ll do the best we can.
    Dudley Nichols, U.S. screenwriter. Jean Renoir. Sorel (Philip Merivale)