Data Compression


Criteria

Survey Formats

Basics

Compression Methods

Data Formats


Huffman Code

Example

Characteristics

Variants

Dynamic Huffman Code

Construction of the Tree

Encoding

Decoding

Alternative Construction

Variance

Adaptive Huffman Code


Glossary

Index


Download


www.BinaryEssence.com

Variance


Even if the two introduced Huffman trees result in the same data volume, they differ in their individual code lengths. This is not of importance for the achievable data compression rate, but it could be of interest for dimensioning memory architectures, e.g. for interfaces with buffered data streams.


Code trees with a different variance:



 <   ^   > 

Dynamic Huffman Code Comparison Adaptive Huffman Code