Output distribution of the burrows-wheeler transform

Karthik Visweswariah; Sanjeev Kulkarni; Sergio Verdú

doi:10.1109/ISIT.2000.866343

Output distribution of the burrows-wheeler transform

Karthik Visweswariah, Sanjeev Kulkarni, Sergio Verdú

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

Abstract

The Burrows-Wheeler transform is a block-sorting algorithm which has been shown empirically to be useful in compressing text data. In this paper we study the output distribution of the transform for i.i.d. sources, tree sources and stationary ergodic sources. We can also give analytic bounds on the performance of some universal compression schemes which use the Burrows-Wheeler transform.

Original language	English (US)
Pages (from-to)	53
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/ISIT.2000.866343
State	Published - 2000

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2000.866343

Cite this

@article{e2284afede254953a21532f5e7656347,

title = "Output distribution of the burrows-wheeler transform",

abstract = "The Burrows-Wheeler transform is a block-sorting algorithm which has been shown empirically to be useful in compressing text data. In this paper we study the output distribution of the transform for i.i.d. sources, tree sources and stationary ergodic sources. We can also give analytic bounds on the performance of some universal compression schemes which use the Burrows-Wheeler transform.",

author = "Karthik Visweswariah and Sanjeev Kulkarni and Sergio Verd{\'u}",

year = "2000",

doi = "10.1109/ISIT.2000.866343",

language = "English (US)",

pages = "53",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Output distribution of the burrows-wheeler transform

AU - Visweswariah, Karthik

AU - Kulkarni, Sanjeev

AU - Verdú, Sergio

PY - 2000

Y1 - 2000

N2 - The Burrows-Wheeler transform is a block-sorting algorithm which has been shown empirically to be useful in compressing text data. In this paper we study the output distribution of the transform for i.i.d. sources, tree sources and stationary ergodic sources. We can also give analytic bounds on the performance of some universal compression schemes which use the Burrows-Wheeler transform.

AB - The Burrows-Wheeler transform is a block-sorting algorithm which has been shown empirically to be useful in compressing text data. In this paper we study the output distribution of the transform for i.i.d. sources, tree sources and stationary ergodic sources. We can also give analytic bounds on the performance of some universal compression schemes which use the Burrows-Wheeler transform.

UR - http://www.scopus.com/inward/record.url?scp=0034448786&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034448786&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2000.866343

DO - 10.1109/ISIT.2000.866343

M3 - Article

AN - SCOPUS:0034448786

SN - 2157-8095

SP - 53

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

ER -

Output distribution of the burrows-wheeler transform

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this