Adaptive Huffman Code

The adaptive Huffman code will be developed in the course of the coding step by step.

In contrast to the static or dynamic coding the symbol distribution will not be determined previously. It will be generated in parallel by using already processed symbols.

Principle:

The weight of each node representing the last encoded symbol will be increased. Afterwards the corresponding part of the tree will be adapted. Thus the tree approaches gradually the current distribution of the symbols. However, the code tree always reflects the "past" and not the real distribution.

 <   ^   >