|
 www.compression-links.info: Find, download & compress! 
|
Adaptive Huffman coding modifies the table as characters are encoded, which allows the encoder to adapt to changing conditions in the input data. Adaptive decoders don't need a copy of the table when decoding, they start with a fixed decoding table and update the table as characters are read in.
| AdaptiveHuffman area, Papers content |
The original paper on the adaptive Huffman codes by Gallager R. PDF.RAR Created: 21/03/2005 by Maxim Smirnov |
| Huffman area, ArithmeticCoding area, Lossless area, AdaptiveHuffman area, SourceCode content | A group of statistical coders from Charles Bloom. This includes several different entropy encoders, including Huffman, Adaptive Huffman, Shannon-Fano, CACM Arithmetic coding, and a Skew Coder. Created: 06/11/1999 by Mark Nelson |
| Tutorials content, Huffman area, AdaptiveHuffman area, SourceCode content |
This site discusses a characteristic of some compression algorithms that the author refers to as One to One (bijective) compression. In a nutshell, this property means that for any file X, F( F'( X ) ) == X. (F is either the compressor or decompressor, and F' is its opposite number.) This is definitely not the case for most conventional compression algorithms. This page has a some Huffman compression code that has been adapted to implement a bijective property. Created: 17/12/1999 by Mark Nelson |
| Huffman area, AdaptiveHuffman area, SourceCode content, Papers content | It's a page on Huffman and Shannon-Fano methods on the Russian compression.ru site. It contains a number of papers and sources, and the major part is in English. It's unlikely that you will have any problems with downloading, since the titles are in English. Created: 21/03/2005 by Maxim Smirnov |
| Tutorials content, Huffman area, LZW area, AdaptiveHuffman area |
This page is designed made to teach people about Lossless compression algorithms through the use of text graphics and Java Applets! Dominik Szopa has created pages that demonstrate Huffman, Adaptive Huffman, and LZW compression.
DCL reader SF has this to say: While the site itself is rather quick, it's disorganized...the Java applets really don't show what's going on at all. They show only the external effects...This site has definate potential, and I do recommend people see it. However, it's also got a ways to go yet. . Created: 24/12/1998 by Mark Nelson |
| AdaptiveHuffman area, SourceCode content |
This is a fairly small C program that was developed on the Amiga.
Note: I'm not sure why, but this page gets a very high number of ratings, nearly all very favorable, although Kate W. did claim: Parts missing from the source code, can't build. Created: 16/12/1999 by Mark Nelson |
| Tutorials content, AdaptiveHuffman area | A nice description of Adaptive Huffman Coding, as seen through a couple of different algorithms. I believe this is part of a survey paper by Debra A. Lelewer and Daniel S. Hirschberg. Created: 10/11/1999 by Mark Nelson |
| AdaptiveHuffman area, SourceCode content | C# implementation of adaptive Huffman coding. Implements both the FGK and Vitter algorithm variations. Compression provided through two public classes, AdaptiveHuffmanProvider and AdaptiveHuffmanStream. Good compression ratios for text-based data Created: 25/04/2004 by Mark Nelson |
| Tutorials content, AdaptiveHuffman area, SourceCode content | David Scott presents an implementation of Vitter's dynamic Huffman compressor, adapted so that it is bijective. Don't know what bijective means? Check out David's home page for more details. Created: 09/12/2002 by Mark Nelson |
| AdaptiveHuffman area, Papers content | J. S. Vitter. ``Design and Analysis of Dynamic Huffman Codes,'' Journal of the ACM, 34(4), October 1987, 825-845. Full paper in PDF and Postscript format. Created: 07/04/2002 by Mark Nelson |
| Tutorials content, Huffman area, LZW area, AdaptiveHuffman area | Class notes on lossless compression algorithms. Quick info on Huffman, Adaptive Huffman, and LZW. Created: 26/02/2002 by Mark Nelson |
| AdaptiveHuffman area, SourceCode content |
A library to perform adpative Huffman coding as described by Knuth in J. Alg. Nice clean looking C source code.
This link continues to be one of the most popular links at DataCompression.info. Reader Karl M. had this comment about the page: The program has a few problems converting from one-based to zero-based arrays. The code for incorporating the last symbol grabs an extra input bit, but since this is usually the EOT symbol, the bug doesn't always cause problems.. Created: 16/12/1999 by Mark Nelson |
