Huffman coding: Difference between revisions

Revision as of 22:32, 13 March 2004

Revision as of 18:13, 15 March 2004

Line 13:

It has been proven that Huffman coding is the most effective compression method of this type.

That is, no other mapping of source symbols to strings of bits will produce a smaller output when the actual symbol frequencies agree with those used to create the code.

For a set of symbols whose cardinality is a [[power of two]] and a uniform probability distribution, Huffman coding is equivalent to simple binary block encoding.

== Basic technique ==