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

http://www.gotdotnet.com/Community/UserSamples/Details.aspx?SampleGuid=c8bc181b-5ddf-4969-
aeca-a508374f1282

This paper describes an adaptive Huffman scheme that is designed to work with large numbers of symbols - at least that’s what the abstract says. The web page indicates that there are executables in the archive, but all I see is a Word document.

http://www.iro.umontreal.ca/~pigeon/programs/programs.html#huffman

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.

http://bijective.dogma.net/compress2vh.htm

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.

http://www.cs.duke.edu/~jsv/Papers/catalog/node60.html

Jeff Vitter’s Pascal implementation of his Adaptive Huffman algorithm. Naturally, this ACM submission is documented in a somewhat academic fashion.

http://www.cs.duke.edu/~jsv/Papers/catalog/node61.html

Class notes on lossless compression algorithms. Quick info on Huffman, Adaptive Huffman, and LZW.

http://www.cs.sfu.ca/CourseCentral/365/li/material/notes/Chap4/Chap4.1/Chap4.1.html

This page has a some Huffman compression code that has been adapted to implement a unique property that author refers to as one to one 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.

http://bijective.dogma.net/

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

http://www.xcf.berkeley.edu/~ali/K0D/Algorithms/huff/

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.

http://www.cbloom.com/src/adaphuff.zip

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.

http://www.ics.uci.edu/~dan/pubs/DC-Sec4.html

A group of statistical coders from Charles Bloom. This includes several different entropy encoders, including Huffman, Adaptive Huffman, CACM Arithmetic coding, and a Skew Coder.

http://www.cbloom.com/src/index_st.html

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

http://www.cs.sfu.ca/CC/365/li/squeeze/