Memory-Efficient Adaptive Huffman Coding
By Steven Pigeon and Yoshua Bengio, October 01, 1998
Although simple and often effective, Huffman's compression algorithm requires a lot of memory for 16-bit Unicode text files, and it doesn't adapt to varying conditions within the data. Steven and Yoshua explain how they updated Huffman's classic technique.
Oct98: Algorithm Alley
Memory-Efficient Adaptive Huffman Coding
By Steven Pigeon and Yoshua Bengio
Dr. Dobb's Journal October 1998
Figure 1: Shannon's formula. S is the set of all possible symbols, p(X=s) is the probability that a particular symbol will occur. H(X) is the total entropy of a data source X.
Copyright © 1998, Dr. Dobb's Journal