Adaptive Huffman coding: Difference between revisions

Revision as of 12:42, 16 March 2016

Revision as of 13:07, 16 March 2016

Line 41:

Note: swapping nodes means swapping weights and corresponding symbols, but not the numbers. Notice that although the above description is excellent in capturing the principle of adaptive Huffman coding, it doesn't maintain Vitter's invariant that all leaves of weight w precede (in the implicit numbering) all internal nodes of weight w. See the example below for a more accurate explanation for Vittter's algorithm<ref name=":0">{{cite web|url=http://www.cs.duke.edu/csed/curious/compression/adaptivehuff.html#tree |title=Adaptive Huffman Coding |publisher=Cs.duke.edu |date= |accessdate=2012-02-26}}</ref>.

====Example: encoding====

====Encoding "abb" gives 01100001 001100010 11.====

[[File:Adaptive Huffman Vitter.jpg]]