The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
An analysis of the Burrows—Wheeler transform
Abstract
The Burrows—Wheeler Transform (also known as Block-Sorting) is at the base of compression algorithms that are the state of the art in lossless data compression. In this paper, we analyze two algorithms that use this technique. The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity outperforms the Gzip compressor. The second one uses an additional run-length encoding step to improve compression. We prove that the compression ratio of both algorithms can be bounded in terms of the k th order empirical entropy of the input string for any k ≥ 0. We make no assumptions on the input and we obtain bounds which hold in the worst case that is for every possible input string. All previous results for Block-Sorting algorithms were concerned with the average compression ratio and have been established assuming that the input comes from a finite-order Markov source.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
Arithmetic coding for data compression
Witten, I. H., Neal, R. M., & Cleary, J. G. (1987) · Communications of the ACM · doi:10.1145/214762.214771 · Cited by 2,877
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
Opportunistic data structures with applications
Ferragina, P., & Manzini, G. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892127 · Cited by 1,063
Self-citationA locally adaptive data compression scheme
Bentley, J. L., Sleator, D. D., Tarjan, R. E., & Wei, V. K. (1986) · Communications of the ACM · doi:10.1145/5684.5688 · Cited by 523
Implementing the PPM data compression scheme
Moffat, A. (1990) · IEEE Transactions on Communications · doi:10.1109/26.61469 · Cited by 420
Unbounded Length Contexts for PPM
Cleary, J. G. (1997) · The Computer Journal · doi:10.1093/comjnl/40.2_and_3.67 · Cited by 232
Data Compression Using Dynamic Markov Modelling
Cormack, G. V., & Horspool, R. N. S. (1987) · The Computer Journal · doi:10.1093/comjnl/30.6.541 · Cited by 213
Practical Implementations of Arithmetic Coding
Howard, P. G., & Vitter, J. S. (1992) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4615-3596-6_4 · Cited by 169
An experimental study of an opportunistic index
Ferragina, P., & Manzini, G. (2001) · doi:10.5555/365411.365458 · Cited by 165
Self-citation
Cited by
Opportunistic data structures with applications
Ferragina, P., & Manzini, G. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892127 · Cited by 1,063
Self-citationNavarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
Ferragina, P., & Manzini, G. (2005) · Journal of the ACM · doi:10.1145/1082036.1082039 · Cited by 686
Self-citationCompressed representations of sequences and full-text indexes
Ferragina, P., Manzini, G., Mäkinen, V., & Navarro, G. (2007) · ACM Transactions on Algorithms · doi:10.1145/1240233.1240243 · Cited by 373
Self-citation
Metadata
- Authors
- Manzini, G.
- Venue
- Journal of the ACM
- Published
- 2001-05
- Volume
- 48
- Issue
- 3
- Pages
- 407-430
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1965853364
- Cited by
- 375
- References
- 14
- FWCI
- 6.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An analysis of the Burrows—Wheeler transform. https://app.cochat.ai/papers/10.1145/382780.382782
- The paper
- Manzini, G. (2001). An analysis of the Burrows—Wheeler transform. Journal of the ACM. https://doi.org/10.1145/382780.382782
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.