The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Data compression with finite windows
Open accessAbstract
Several methods are presented for adaptive, invertible data compression in the style of Lempel's and Ziv's first textual substitution proposal. For the first two methods, the article describes modifications of McCreight's suffix tree data structure that support cyclic maintenance of a window on the most recent source characters. A percolating update is used to keep node positions within the window, and the updating process is shown to have constant amortized cost. Other methods explore the tradeoffs between compression time, expansion time, data structure size, and amount of compression achieved. The article includes a graph-theoretic analysis of the compression penalty incurred by our codeword selection policy in comparison with an optimal policy, and it includes empirical studies of the performance of various adaptive compressors from the literature.
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
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
Cited by
A new challenge for compression algorithms: Genetic sequences
Grumbach, S., & Tahi, F. (1994) · Information Processing & Management · doi:10.1016/0306-4573(94)90014-0 · Cited by 272
Bell, T., Witten, I. H., & Cleary, J. G. (1989) · ACM Computing Surveys · doi:10.1145/76894.76896 · Cited by 261
Metadata
- Authors
- Fiala, E. R., & Greene, D. H.
- Venue
- Communications of the ACM
- Published
- 1989-04
- Volume
- 32
- Issue
- 4
- Pages
- 490-505
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2029353114
- Cited by
- 178
- References
- 1
- FWCI
- 5.23
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Data compression with finite windows. https://app.cochat.ai/papers/10.1145/63334.63341
- The paper
- Fiala, E. R., & Greene, D. H. (1989). Data compression with finite windows. Communications of the ACM. https://doi.org/10.1145/63334.63341
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.