A Block-Sorting Lossless Data Compression Algorithm (1994)
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {A Block-sorting Lossless and Michael Burrows and M. Burrows and David Wheeler and D. J. Wheeler},
title = {A Block-Sorting Lossless Data Compression Algorithm},
institution = {Digital SRC Research Report},
year = {1994}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
We describe a block-sorting, lossless data compression algorithm, and our implementation of that algorithm. We compare the performance of our implementation with widely available data compressors running on the same hardware. The algorithm works by applying a reversible transformation to a block of input text. The transformation does not itself compress the data, but re-orders it to make it easy to compress with simple algorithms such as move-to-front encoding. Our algorithm achieves speed comparable to algorithms based on the techniques of Lempel and Ziv, but optains compression close to the best statistical modelling techniques. The size of the input block must be large (a few kilobytes) to achieve good compression.
