Definition: An adaptive Huffman coding scheme. Coding is never much worse than twice optimal.
Generalization (I am a kind of ...)
adaptive Huffman coding.
See also Vitter's algorithm.
survey of data compression
Donald E. Knuth, Dynamic Huffman Coding, Journal of Algorithms, 6(2):163-180, June 1985.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "algorithm FGK", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/algorithmFGK.html