A locally adaptive data compression scheme
Communications of the ACM
Text compression
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
Burrows--Wheeler compression with variable length integer codes
Software—Practice & Experience
A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 Proceedings of the Conference on Data Compression
Move-to-Front and Inversion Coding
DCC '00 Proceedings of the Conference on Data Compression
DCC '02 Proceedings of the Data Compression Conference
Can We Do without Ranks in Burrows Wheeler Transform Compression?
DCC '01 Proceedings of the Data Compression Conference
Fast Compression with a Static Model in High-Order Entropy
DCC '04 Proceedings of the Conference on Data Compression
A Fast and Efficient Post BWT-Stage for the Burrows-Wheeler Compression Algorithm
DCC '05 Proceedings of the Data Compression Conference
Context exhumation after the Burrows-Wheeler transform
Information Processing Letters
The engineering of a compression boosting library: theory vs practice in BWT compression
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The myriad virtues of wavelet trees
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
PPM compression without escapes
Software—Practice & Experience
| Hi-index | 5.24 |
After a general description of the Burrows-Wheeler transform and a brief survey of recent work on processing its output, the paper examines the coding of the zero-runs from the MTF recoding stage, an aspect with little prior treatment. It is concluded that the original scheme proposed by Wheeler is extremely efficient and unlikely to be much improved. The paper then proposes some new interpretations and uses of the Burrows-Wheeler transform, with new insights and approaches to lossless compression, perhaps including techniques from error correction.