Dynamic Huffman Code

This coding scheme presupposes a previous determination of the symbol distribution. The actual algorithm starts with this distribution which is regarded as constant about the entire data. If the symbol distribution changes, then either losses in compression or a completely new construction of the code tree must be accepted (incl. header data required).

In the following an example for a simple code tree is presented together with some principal considerations.

 <   ^   >