An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Word-based block-sorting text compression
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
DCC '00 Proceedings of the Conference on Data Compression
PPM Performance with BWT Complexity: A New Method for Lossless Data Compression
DCC '00 Proceedings of the Conference on Data Compression
Impact of Data Compression on Energy Consumption of Wireless-Networked Handheld Devices
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Can We Do without Ranks in Burrows Wheeler Transform Compression?
DCC '01 Proceedings of the Data Compression Conference
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
| Hi-index | 0.00 |
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.