Talk:Adaptive Huffman coding

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Hi, everyone.

I put up this article because, IMHO, an adaptive technique deserves a walktrough. But I'm in doubt, maybe just erase it and give a bunch of links to good sites, even merge to Huffman.

And that thing with numbers seems to be just a heap structure trick, maybe even propritary. Highest number == Topmost right.

Gnomz007 17:49, 11 Oct 2004 (UTC)

FGK -> Vitter

The algorithme described is the Vitter alg., not the FGK alg..

Swap

I don't understand one thing: should the nodes be swapped together with its subtree? I guess it is so so that the weights correspond and so that the tree can change its shape. Yet, I may have missed something. --Honnza 08:25, 14 July 2006 (UTC)[reply]

http://commons.wikimedia.org/wiki/File:A_detailed_example_of_FGK_Algorithm.pdf