Huffman coding: Difference between revisions

Revision as of 15:41, 31 March 2003

Revision as of 11:01, 31 May 2003

Line 25:

(This variation requires that a [[frequency table]] or other hint as to the encoding must be stored with the compressed text; implementations employ various tricks to store these tables efficiently.)

A variation called "adaptive Huffman coding" calculates the frequencies dynamically based on recent actual frequencies in the source string.

Extrem cases of Huffman codes are connected with Fibonacci numbers (http://mathforum.org/discuss/sci.math/t/207334).

Huffman coding today is often used as a "back-end" to some other compression method.