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:

    History does nothing; it does not possess immense riches, it does not fight battles. It is men, real, living, who do all this.... It is not “history” which uses men as a means of achieving—as if it were an individual person—its own ends. History is nothing but the activity of men in pursuit of their ends.
    Karl Marx (1818–1883)

    The History of the world is not the theatre of happiness. Periods of happiness are blank pages in it, for they are periods of harmony—periods when the antithesis is in abeyance.
    Georg Wilhelm Friedrich Hegel (1770–1831)

    The history of literature—take the net result of Tiraboshi, Warton, or Schlegel,—is a sum of a very few ideas, and of very few original tales,—all the rest being variation of these.
    Ralph Waldo Emerson (1803–1882)