Revision as of 11:01, 31 May 2003 edit Alex Vinokur~enwiki (talk \| contribs) 60 edits No edit summary ← Previous edit		Revision as of 11:07, 31 May 2003 edit undo Iseeaboar (talk \| contribs) 156 edits typo, formatting Next edit →
Line 26: A variation called "adaptive Huffman coding" calculates the frequencies dynamically based on recent actual frequencies in the source string. ~~Extrem~~Extreme cases of Huffman codes are connected with Fibonacci numbers. For example, see (http://mathforum.org/discuss/sci.math/t/207334). Huffman coding today is often used as a "back-end" to some other compression method. [[Data compression/Deflation\|Deflation]] (PKZIP's algorithm) and multimedia codecs such as [[JPEG]] and [[MP3]] have a front-end model and quantization followed by Huffman coding. ~~[[Data compression/Deflation\|Deflation]] (PKZIP's algorithm) and multimedia codecs such as [[JPEG]] and [[MP3]] have a front-end model and quantization followed by Huffman coding.~~

Huffman coding: Difference between revisions