Data Compression


Criteria

Survey Formats

Basics

Compression Methods

Shannon-Fano

Huffman

Lempel-Ziv (LZ)

Arithmetic Coding

Run Length Encoding

Burrows-Wheeler (BWT)

Implementations

Data Formats


Glossary

Index


Download


www.BinaryEssence.com

Survey Compression Methods


In the following a variety of compression methods will be introduced. Some of those methods are worked out in detail. In this case the general descriptions will provide corresponding links.


Primarily fundamental mechanisms and procedures will be described, implementation details are not considered at this part. Most of the methods will be used by different formats and for different purposes. Information about utilization is available at 'Data Formats'.


General descriptions:

Shannon-Fano Coding [Code tree according to Claude Shannon and Robert Fano]

Huffman Coding [Code tree according to David Huffman]

Lempel-Ziv Coding (LZ) [Methods based on the work of Abraham Lempel and Jacob Ziv.]

LZ77 [Lempel-Ziv coding published in 1977]

LZSS [Lempel-ZIV-Storer-Szymanski]

LZ78 [Lempel-Ziv coding published in 1978]

LZW [Lempel-ZIV-Welch]

Arithmetic Coding [Arithmetic coding]

Run Length Encoding [RLE - Run Length Encoding]

Burrows-Wheeler-Transformation (BWT) [Burrows-Wheeler-Transformation (BWT)]

Implementations [Implementations]

Deflate [Deflate]

Deflate64™ [Deflate64™]


Detailled descriptions:

Huffman Coding [Code tree according to David Huffman]

Arithmetic Coding [Arithmetic coding]

Run Length Encoding [RLE - Run Length Encoding]


 <   ^   > 

Data Compression Characteristics of Code Trees Shannon-Fano Coding