Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
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.
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
J. LaRue, C. Ting
Proceedings of SPIE 1989
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering