The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Implementing the PPM data compression scheme
Abstract
The prediction by partial matching (PPM) data compression algorithm developed by J. Cleary and I. Witten (1984) is capable of very high compression rates, encoding English text in as little as 2.2 b/character. It is shown that the estimates made by Cleary and Witten of the resources required to implement the scheme can be revised to allow for a tractable and useful implementation. In particular, a variant is described that encodes and decodes at over 4 kB/s on a small workstation and operates within a few hundred kilobytes of data space, but still obtains compression of about 2.4 b/character for English text.>
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
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
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 Technique for High-Performance Data Compression
Welch (1984) · Computer · doi:10.1109/mc.1984.1659158 · Cited by 2,182
Data Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
A 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
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
Moffat, A. (1989) · Software: Practice and Experience · doi:10.1002/spe.4380190207 · Cited by 172
Self-citationInterval and recency rank source coding: Two on-line adaptive variable-length schemes
Eliaš, P. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057251 · Cited by 113
Cited by
Moffat, A., Neal, R. M., & Witten, I. H. (1998) · ACM Transactions on Information Systems · doi:10.1145/290159.290162 · Cited by 471
Self-citationAn analysis of the Burrows—Wheeler transform
Manzini, G. (2001) · Journal of the ACM · doi:10.1145/382780.382782 · Cited by 375
The string B-tree: a new data structure for string search in external memory and its applications
Ferragina, P., & Grossi, R. (1999) · Journal of the ACM · doi:10.1145/301970.301973 · Cited by 317
Cheung, V. K. M., Harrison, P. M. C., Meyer, L., Pearce, M. T., Haynes, J.-D., & Koelsch, S. (2019) · Current Biology · doi:10.1016/j.cub.2019.09.067 · Cited by 298
Off-line dictionary-based compression
Larsson, N. J., & Moffat, A. (2000) · Proceedings of the IEEE · doi:10.1109/5.892708 · Cited by 259
Self-citation
Metadata
- Authors
- Moffat, A.
- Venue
- IEEE Transactions on Communications
- Published
- 1990
- Volume
- 38
- Issue
- 11
- Pages
- 1917-1921
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2135771747
- Cited by
- 420
- References
- 8
- FWCI
- 1.98
- 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
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.