Differences between current version and previous revision of HuffmanCoding.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 8 | Last edited on Sunday, February 23, 2003 2:58:54 am | by AristotlePagaltzis | |
| Older page: | version 7 | Last edited on Sunday, February 23, 2003 2:48:28 am | by AristotlePagaltzis | Revert |
@@ -20,9 +20,9 @@
See also http://datacompression.info/Huffman.shtml
----
-This sounds like an UrbanLegend to me. [
DavidHuffman]
was not the one invented entropy driven compression; [Shannon]
and [Fano
] did that. [Huffman
]'s contribution was to come up with an algorithm to create an optimal dictionary given a set of weights for a set of symbols which results in the minimum possible length of the encoded data stream. --AristotlePagaltzis
+This sounds like an UrbanLegend to me. DavidHuffman was not the one invented entropy driven compression; [Claude Elwood
Shannon|http://www-gap.dcs.st-
and.ac.uk/~history/Mathematicians/Shannon.html
] and RobertMFano
did that. [DavidHuffman
]'s contribution was to come up with an algorithm to create an optimal dictionary given a set of weights for a set of symbols which results in the minimum possible length of the encoded data stream. --AristotlePagaltzis
It's possibly a bit of an UrbanLegend, but he did design it for a term paper, I think anyone that invents an efficient compression method such as HuffmanCoding for a term paper deserves an A+ no matter what :) --PerryLorier
I seem to recall that the professor of that class gave students the option of a mix of papers and exam, or they could "bet" their whole course grade on a single paper. DavidHuffman chose the paper option and came up with it very shortly before the paper was due... -- JohnMcPherson
