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 with Uniform Distribution


For initialization a frequency of 1 is assigned to each possible symbol independently from its later use. The code tree generated in this way will afterwards be adapted successively with every encoded symbol.


The code length of the individual elements is identical to a fixed length code which is a particular case of a variable length code. If a message source is able to generate 8 different messages, a code length of 3 bit (ld 8) is required.


Initial code tree with 8 symbols:


 <   ^   > 

Initialization Initialization with standard distribution Extension for New Symbols