Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
The Burrows-Wheeler transform is a block-sorting algorithm which has been shown empirically to be useful in compressing text data. In this paper we study the output distribution of the transform for i.i.d. sources, tree sources and stationary ergodic sources. We can also give analytic bounds on the performance of some universal compression schemes which use the Burrows-Wheeler transform.
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Charles Micchelli
Journal of Approximation Theory