Differences between version 4 and revision by previous author of HuffmanCoding.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 4 | Last edited on Saturday, February 22, 2003 12:54:43 pm | by PerryLorier | Revert |
| Older page: | version 2 | Last edited on Saturday, February 22, 2003 5:17:01 am | by AristotlePagaltzis | Revert |
@@ -1,7 +1,9 @@
Rumour goes that a professor once said to his class that they'd get an A+ in a course if they could invent a better compression method than dictionary compression(?), believing the problem to be impossible. Mr Huffman was sitting in the audience, and actually achieved it, creating 'Huffman Coding' and an A+ :)
-:This sounds like an UrbanLegend to me. [Huffman
] 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; [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
+
+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 :)
HuffmanCoding is a PrefixFreeCode, which means that no code is a prefix of another one.
an example HuffmanCoding might be
