Talk:Adaptive Huffman coding

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing Mid‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing Mid This article has been rated as Mid-importance on the project's importance scale.

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)

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

See also http://www.cs.duke.edu/csed/curious/compression/adaptivehuff.html

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