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
Jianke Yang, Robin Walters, et al.
ICML 2023
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems