(algorithm)
Definition: A near-minimal variable-length character coding that changes based on the frequency of characters processed. As characters are processed, frequencies are updated and codes are changed (or, the coding tree is modified).
Also known as dynamic Huffman coding.
Generalization (I am a kind of ...)
Huffman coding.
Specialization (... is a kind of me.)
Vitter's algorithm, algorithm FGK.
Note: The total message length can be less than that produced by a static Huffman coding since the coding can be different at different places in the message.
Author: PEB
Explanation of algorithm FGK and Vitter's Algorithm (algorithm V), two different adaptive Huffman coding algorithms.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:22:59 2004.
HTML page formatted Wed Oct 26 09:47:08 2005.
Cite this as:
Paul E. Black, "adaptive Huffman coding", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/adaptiveHuffman.html
