Huffman coding: Difference between revisions

Revision as of 00:28, 14 December 2003

Revision as of 20:41, 20 January 2004

Line 33:

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

[[DEFLATE]] ([[PKZIP]]'s algorithm) and multimedia codecs[[codec]]s such as [[JPEG]] and [[MP3]] have a front-end model and [[quantization]] followed by Huffman coding.

n-ary Huffman algorithm uses the {0, 1, ..., n-1} alphabet to encode message. Built tree is n-ary one.