Data Compression


Criteria

Survey Formats

Basics

Compression Methods

Data Formats


Huffman Code

Example

Characteristics

Variants

Dynamic Huffman Code

Adaptive Huffman Code

Initialization

Standard Distribution

Uniform Distribution

Extension for New Symbols

Pros and Cons

Algorithm

Example


Glossary

Index


Download


www.BinaryEssence.com

Initialization


Because the adaptive Huffman code uses previously encoded symbols, an initialization problem arises at the beginning of the coding. At first the code tree is empty and does not contain symbols from already encoded data. To solve this, a suitable initialization has to be utilized. Among others the following options are available:

  • A standard distribution will be used that is available at the encoder as well as the decoder.
  • An initial code tree will be generated with a frequency of 1 for each symbol.
  • A special control character will be added identifying new symbols following.

 <   ^   > 

Adaptive Huffman Code Adaptive Huffman Code Initialization with Standard Distribution