Published 1999
| public
Book Section - Chapter
Open
Universal lossless source coding with the Burrows Wheeler transform
- Creators
- Effros, Michelle
- Others:
- Storer, James A.
- Cohn, Martin
Chicago
An error occurred while generating the citation.
Abstract
We here consider a theoretical evaluation of data compression algorithms based on the Burrows Wheeler transform (BWT). The main contributions include a variety of very simple new techniques for BWT-based universal lossless source coding on finite-memory sources and a set of new rate of convergence results for BWT-based source codes. The result is a theoretical validation and quantification of the earlier experimental observation that BWT-based lossless source codes give performance better than that of Ziv-Lempel-style codes and almost as good as that of prediction by partial mapping (PPM) algorithms.
Additional Information
© Copyright 1999 IEEE. Reprinted with permission. This material is based upon work partially supported by NSF CAREER Grant No. MIP-9501977, a grant from the Powell Foundation, and donations through the Intel 2000 Technology for Education Program.Files
EFFdcc99.pdf
Files
(387.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:7de5002858aad2519fe56c87dce09831
|
387.3 kB | Preview Download |
Additional details
- Eprint ID
- 7334
- Resolver ID
- CaltechAUTHORS:EFFdcc99
- Created
-
2007-02-01Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field