Content deleted Content added
typo, formatting |
No edit summary |
||
Line 29:
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.
n-ary Huffman algorithm uses the {0, 1, ..., n-1} alphabet to encode message. Built tree is n-ary one.
Huffman template algorithm enables
to use non-numerical weights (costs, frequences).
| |||