Data Compression


Criteria

Survey Formats

Basics

Compression Methods

Data Formats


Huffman Code

Example

Characteristics

Variants

Dynamic Huffman Code

Adaptive Huffman Code

Initialization

Algorithm

Table Code Tree

Update Procedure

New Symbols

Update Code Tree

Decoding

Example


Glossary

Index


Download


www.BinaryEssence.com

Procedure Decoding


The decoding process works by branching through the code tree according to the rules for any binary code trees. After the decoding of each symbol the tree will be updated by the procedure previously described.


If the control character NYA appears, then the following symbol will be read using the current parameters b and r. The new symbol has also to be appended to the code tree followed by an update of the corresponding branches. The parameters b and r has to be recalculated according to the reduced number of symbols.


 <   ^   > 

 Interpretation of Code Trees 

Algorithm Adaptive Huffman Code Update Code Tree Example abracadabra