The Burrows-Wheeler Transform is a string-to-string transform which, when used as a preprocessing phase in compression, significantly enhances the compression rate. However, it often puzzles people how the inverse transform is carried out. In this pearl we to exploit simple equational reasoning to derive the inverse of the Burrows-Wheeler transform from its specification. We also outline how to derive the inverse of two more general versions of the transform, one proposed by Schindler and the other by Chapin and Tate.
CITATION STYLE
Bird, R. S., & Shin-Cheng, M. U. (2004). Inverting the burrows-wheeler transform. Journal of Functional Programming, 14(6), 603–612. https://doi.org/10.1017/S0956796804005118
Mendeley helps you to discover research relevant for your work.