adaptive Huffman coding

Quick Reference

A dynamic variant of Huffman coding for data compression that can adjust the representation of characters depending on local properties of the text that is being processed. For example a file might contain natural language text and computer programs. An adaptive Huffman compression scheme would use one transformation for the natural language and another for the programs. The technique is also known as the FGK algorithm.

Subjects: Computing.

Reference entries