Data Compression


Criteria

Survey Formats

Basics

Compression Methods

Shannon-Fano

Huffman

Lempel-Ziv (LZ)

Arithmetic Coding

Run Length Encoding

Burrows-Wheeler (BWT)

Implementations

Deflate

Basic Algorithm

Data Structure

Huffman Code Trees

Data and Lengths

Distance

Static and Dynamic

Deflate64™

Data Formats


Glossary

Index


Download


www.BinaryEssence.com

Deflate: Code Tree for Original Data and Sequence Lengths


This code tree contains all original data, the basic codes for lengths and a control character identifying the end of the current block:


Value Symbol
0 - 255 original symbols, "literals"
256 control character "end of block"
256 - 285 length codes

The length codes are additionally succeeded by a different number of extra bits (0 - 5 bit) expanding the range of values. This allows to represent sequences with a length between 3 and 258 byte.


 <   ^   > 

Deflate Deflate: Huffman Code Trees Deflate: Distance Tree