DocumentCode
2684583
Title
Universal lossless source coding with the Burrows Wheeler transform
Author
Effros, Michelle
Author_Institution
California Inst. of Technol., Pasadena, CA, USA
fYear
1999
fDate
29-31 Mar 1999
Firstpage
178
Lastpage
187
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
Keywords
convergence of numerical methods; source coding; transforms; Burrows Wheeler transform; convergence; data compression; finite-memory sources; performance; universal lossless source coding; Algorithm design and analysis; Compression algorithms; Convergence; Data compression; Educational programs; Educational technology; Engineering profession; Performance analysis; Performance loss; Source coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1999. Proceedings. DCC '99
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-7695-0096-X
Type
conf
DOI
10.1109/DCC.1999.755667
Filename
755667
Link To Document