Can we do without ranks in Burrows Wheeler transform compression?

Compressors based on the Burrows Wheeler transform (1994) convert the transformed text into a string of (move-to-front) ranks. These ranks are then encoded with an Order-0 model, or a hierarchy of such models. Although these rank-based methods perform very well, we believe the transformation to MTF numbers blurs the distinction between individual symbols and is a possible cause of inefficiency. Instead of relying on symbol ranking, we examine the problem of directly encoding the symbols in the BWT text.

[1]  Sebastian Deorowicz.  Improvements to Burrows–Wheeler compression algorithm , 2000 .

[2]  Brenton Chapin.  Switching between two on-line list update algorithms for higher compression of Burrows-Wheeler transformed data , 2000, Proceedings DCC 2000. Data Compression Conference.

[3]  Frans M. J. Willems,et al.  Switching between two universal source coding algorithms , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[4]  Michelle Effros,et al.  Universal lossless source coding with the Burrows Wheeler transform , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[5]  Kunihiko Sadakane.  Text compression using recency rank with context and relation to context sorting, block sorting and PPM/sup */ , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[6]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[7]  M. Schindler,et al.  A fast block-sorting algorithm for lossless data compression , 1997, Proceedings DCC '97. Data Compression Conference.

[8]  Bernhard Balkenhol,et al.  Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice , 2000, IEEE Trans. Computers.

[9]  David S. Wheeler,et al.  An implementation of block coding , 1995 .

[10]  Spyros S. Magliveras,et al.  Block sorting and compression , 1997, Proceedings DCC '97. Data Compression Conference.

[11]  Bernhard Balkenhol,et al.  Modifications of the Burrows and Wheeler data compression algorithm , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[12]  Anthony Ian Wirth.  Symbol-driven compression of Burrows Wheeler transformed text , 2001 .

[13]  Bernhard Balkenhol,et al.  One attempt of a compression algorithm using the BWT , 1999 .

[14]  P. Fenwick,et al.  Block Sorting Text Compression -- Final Report , 1996 .

[15]  P.A.J. Volf,et al.  The switching method: elaborations , 1998 .

[16]  Jeffrey Scott Vitter,et al.  Design and analysis of fast text compression based on quasi-arithmetic coding , 1993, [Proceedings] DCC `93: Data Compression Conference.

[17]  Ian H. Witten,et al.  Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..