http://fileformats.archiveteam.org/index.php?action=history&feed=atom&title=Adaptive_Huffman_coding 2026-04-11T13:25:55Z Revision history for this page on the wiki MediaWiki 1.19.2 http://fileformats.archiveteam.org/index.php?title=Adaptive_Huffman_coding&diff=37945&oldid=prev 2020-09-12T11:29:31Z

<p>Created page with &quot;{{FormatInfo |formattype=electronic |subcat=Compression }} &#039;&#039;&#039;Adaptive Huffman coding&#039;&#039;&#039; is a class of data compression algorithms based on <a href="/wiki/Huffman_coding" title="Huffman coding">Huffman coding</a>. Adaptive Huffm...&quot;</p> <p><b>New page</b></p><div>{{FormatInfo<br /> |formattype=electronic<br /> |subcat=Compression<br /> }}<br /> '''Adaptive Huffman coding''' is a class of data compression algorithms based on [[Huffman coding]].<br /> <br /> Adaptive Huffman is also known as ''dynamic Huffman'', but ''dynamic Huffman'' is sometimes used more generally, to mean something like &quot;any format in which the Huffman codebook can be changed&quot;.<br /> <br /> == Discussion ==<br /> With adaptive Huffman coding, the Huffman codebook is not stored in the file. Instead, it is constructed and re-optimized automatically as each successive encoded symbol (e.g. byte) in a stream is compressed or decompressed.<br /> <br /> == Links ==<br /> * [[Wikipedia: Adaptive Huffman coding]]</div>

Jsummers