A locally adaptive data compression scheme
Communications of the ACM
Robust transmission of unbounded strings using Fibonacci representations
IEEE Transactions on Information Theory
ACM Computing Surveys (CSUR)
Arithmetic coding for data compression
Communications of the ACM
Robust universal complete codes for transmission and compression
Discrete Applied Mathematics
ACM Transactions on Information Systems (TOIS)
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
Introduction to Algorithms
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Boosting textual compression in optimal linear time
Journal of the ACM (JACM)
The engineering of a compression boosting library: theory vs practice in BWT compression
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Move-to-Front, Distance Coding, and Inversion Frequencies revisited
Theoretical Computer Science
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Balancing and clustering of words in the Burrows-Wheeler transform
Theoretical Computer Science
Most burrows-wheeler based compressors are not optimal
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 5.23 |
In this paper, we present a new technique for worst-case analysis of compression algorithms which are based on the Burrows-Wheeler Transform. We mainly deal with the algorithm proposed by Burrows and Wheeler in their first paper on the subject [M. Burrows, D.J. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, Palo Alto, California, 1994], called bw0. This algorithm consists of the following three essential steps: (1) Obtain the Burrows-Wheeler Transform of the text, (2) Convert the transform into a sequence of integers using the move-to-front algorithm, (3) Encode the integers using Arithmetic code or any order-0 encoding (possibly with run-length encoding). We achieve a strong upper bound on the worst-case compression ratio of this algorithm. This bound is significantly better than bounds known to date and is obtained via simple analytical techniques. Specifically, we show that for any input string s, and @m1, the length of the compressed string is bounded by @m@?|s|H"k(s)+log(@z(@m))@?|s|+@mg"k+O(logn) where H"k is the kth order empirical entropy, g"k is a constant depending only on k and on the size of the alphabet, and @z(@m)=11^@m+12^@m+... is the standard zeta function. As part of the analysis, we prove a result on the compressibility of integer sequences, which is of independent interest. Finally, we apply our techniques to prove a worst-case bound on the compression ratio of a compression algorithm based on the Burrows-Wheeler Transform followed by distance coding, for which worst-case guarantees have never been given. We prove that the length of the compressed string is bounded by 1.7286@?|s|H"k(s)+g"k+O(logn). This bound is better than the bound we give for bw0.