Jump to content

Talk:Adaptive Huffman coding

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cewbot (talk | contribs) at 18:09, 22 January 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computing}}.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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..

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

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

hi — Preceding unsigned comment added by Oiuy7t (talk • contribs) 23:31, 20 May 2020 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Adaptive_Huffman_coding&oldid=1197993864"