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:

    You that would judge me do not judge alone
    This book or that, come to this hallowed place
    Where my friends’ portraits hang and look thereon;
    Ireland’s history in their lineaments trace;
    Think where man’s glory most begins and ends
    And say my glory was I had such friends.
    William Butler Yeats (1865–1939)

    The view of Jerusalem is the history of the world; it is more, it is the history of earth and of heaven.
    Benjamin Disraeli (1804–1881)

    Gossip is charming! History is merely gossip. But scandal is gossip made tedious by morality.
    Oscar Wilde (1854–1900)