Burrows-Wheeler Transform

Posted by Beetle B. on Sun 07 December 2014

The method: Given a string of, say, length 8, form all 8 rotations of it, and then sort them lexicographically. Then form the 8 letter string by taking the last column of each entry (in sequence).

This is the transform. It is, however, more amenable to compression by, say, run length encoding.