Data Compression Theory and Practice

Data Compression Theory and Practice
Data compession is another of my hobbies, and also a place where I make occasional contributions.

The Data Compression Library
Compression FAQ Index
The theoretical underpinnings of the bzip2 compression tool
- "A block-sorting lossless data compression algorithm"
  Michael Burrows and D. J. Wheeler.
- directory containing program bred3.c and accompanying document bred3.ps
  David J. Wheeler. This contains the idea behind the multi-table Huffman coding scheme.
- "Fast Algorithms for Sorting and Searching Strings"
  Jon L. Bentley and Robert Sedgewick. Available from Sedgewick's web page,
- Block Sorting Text Compression
  Peter Fenwick. This paper gives valuable additional insights into the algorithm, but is not immediately the basis of any code used in bzip2. Part of: Proceedings of the 19th Australasian Computer Science Conference, Melbourne, Australia. Jan 31 - Feb 2, 1996.
- Kunihiko Sadakane's sorting algorithm
- The Manber-Myers suffix array construction algorithm is described in this paper

This page, maintained by
Kent Paul Dolan
xanthian@well.com ,
was last updated
20030504.