Huffman coding: Difference between revisions

Revision as of 21:35, 14 February 2003

Revision as of 22:22, 14 February 2003

Line 7:

Huffman coding uses a specific method for choosing the representations for each symbol, resulting in a prefix-free code (i.e. no bit string of any symbol is a prefix of the bit string of any other symbol).

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. However,For Huffmana codingset mayof failsymbols inwhose thecardinality caseis thata the setpower of symbolstwo hasand a uniform probability distribution, Huffman coding is equivelent to simple binary block encoding.

Huffman coding is optimal when the frequencies of input characters are powers of two.