Talk:Adaptive Huffman coding
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
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
[edit]The algorithme described is the Vitter alg., not the FGK alg..
See also http://www.cs.duke.edu/csed/curious/compression/adaptivehuff.html
Swap
[edit]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)
http://commons.wikimedia.org/wiki/File:A_detailed_example_of_FGK_Algorithm.pdf
hi — Preceding unsigned comment added by Oiuy7t (talk • contribs) 23:31, 20 May 2020 (UTC)