The Data Compression Library - Adaptive Huffman Coding Adaptive Huffman Coding Traditional Huffman Coding uses a static dictionary, which means each item in the file is encoded the same way.
Typical implementations send the encoding table to the decoder as part of the encoded file.
Adaptive Huffman coding modifies the table as characters are encoded, which allows the encoder to adapt to changing conditions in the input data. Adaptive decoders don't need a copy of the table when decoding, they start with a fixed decoding table and update the table as characters are read in. Search compression newsgroups for references to this topic Please be sure to visit Friends of the Library. Badtz Maru will be your guide. 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.