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:

    “Most events recorded in history are more remarkable than important, like eclipses of the sun and moon, by which all are attracted, but whose effects no one takes the trouble to calculate.”
    —Henry David Thoreau (1817–1862)

    “To history therefore I must refer for answer, in which it would be an unhappy passage indeed, which should shew by what fatal indulgence of subordinate views and passions, a contest for an atom had defeated well founded prospects of giving liberty to half the globe.”
    —Thomas Jefferson (1743–1826)

    “The history of all hitherto existing society is the history of class struggles.”
    —Karl Marx (1818–1883)