## Universal Lossless Source Coding With the Burrows Wheeler Transform (2002)

### Cached

### Download Links

- [sensorweb.mit.edu]
- [www.ee.princeton.edu]
- [www.princeton.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE TRANSACTIONS ON INFORMATION THEORY |

Citations: | 38 - 3 self |

### BibTeX

@ARTICLE{Effros02universallossless,

author = {Michelle Effros and Karthik Visweswariah and Sanjeev R. Kulkarni and Sergio Verdú},

title = {Universal Lossless Source Coding With the Burrows Wheeler Transform},

journal = {IEEE TRANSACTIONS ON INFORMATION THEORY},

year = {2002},

volume = {48},

number = {5},

pages = {1061--1081}

}

### Years of Citing Articles

### OpenURL

### Abstract

The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWT-based compression schemes are widely touted as low-complexity algorithms giving lossless coding rates better than those of the Ziv--Lempel codes (commonly known as LZ'77 and LZ'78) and almost as good as those achieved by prediction by partial matching (PPM) algorithms. To date, the coding performance claims have been made primarily on the basis of experimental results. This work gives a theoretical evaluation of BWT-based coding. The main results of this theoretical evaluation include: 1) statistical characterizations of the BWT output on both finite strings and sequences of length , 2) a variety of very simple new techniques for BWT-based lossless source coding, and 3) proofs of the universality and bounds on the rates of convergence of both new and existing BWT-based codes for finite-memory and stationary ergodic sources. The end result is a theoretical justification and validation of the experimentally derived conclusions: BWT-based lossless source codes achieve universal lossless coding performance that converges to the optimal coding performance more quickly than the rate of convergence observed in Ziv--Lempel style codes and, for some BWT-based codes, within a constant factor of the optimal rate of convergence for finite-memory sources.