Using the Burrows Wheeler block sorting text compression algorithm on:
 S = "mississippi".


      0 1 2 3 4 5 6 7 8 9 10
      -----------------------
  0 | i m i s s i s s i p p
  1 | i p p i m i s s i s s
  2 | i s s i p p i m i s s
  3 | i s s i s s i p p i m
  4 | m i s s i s s i p p i
  5 | p i m i s s i s s i p
  6 | p p i m i s s i s s p
  7 | s i p p i m i s s i s
  8 | s i s s i p p i m i s
  9 | s s i p p i m i s s i
 10 | s s i s s i p p i m i

  1. Matrix M: Shifts in lexicographic order

  3. The output from the block sort: L and I

     The Last Column: L = "pssmipissii"; and index of S in M: I = 4.

     Note that Y is initialized to "imps" in this example.

  4. After move-to-front-coding, we obtain R:

    (2, 3, 0, 3, 3, 3, 1, 3, 0, 1, 0; 4)


     The last 4 is the value of I (the index of S in M).

     Explanation:
     ------------
     R = imps   R[0] = 2  (symbol L[0] = p)
     R = pims   R[1] = 3  (  "    L[1] = s)
     R = spim   R[2] = 0  (  "    L[2] = s)
     R = spim   R[3] = 3  (  "    L[3] = m)
     R = mspi   R[4] = 3  (  "    L[4] = i)
     R = imsp   R[5] = 3  (  "    L[5] = p)
     R = pims   R[6] = 1  (  "    L[6] = i)
     R = ipms   R[7] = 3  (  "    L[7] = s)
     R = sipm   R[8] = 0  (  "    L[8] = s)
     R = sipm   R[9] = 1  (  "    L[9] = i)
     R = ispm   R[10]= 0  (  "    L[10]= i)
     R = ispm