Revision as of 12:03, 31 May 2003 edit Alex Vinokur~enwiki (talk \| contribs) 60 edits No edit summary ← Previous edit		Revision as of 12:05, 31 May 2003 edit undo Alex Vinokur~enwiki (talk \| contribs) 60 edits n-ary Huffman algorithm, Huffman Template algorithm Next edit →
Line 32: 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). For example, see http://alexvn.freeservers.com/s1/huffman_template_algorithm.html ~~Huffman template algorithm enables~~ ~~to use non-numerical weights (costs, frequences).~~

Huffman coding: Difference between revisions