The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A Technique for High-Performance Data Compression
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
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
Data compression via textual substitution
Storer, J. A., & Szymanski, T. G. (1982) · Journal of the ACM · doi:10.1145/322344.322346 · Cited by 634
Cited by
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
The World’s Technological Capacity to Store, Communicate, and Compute Information
Hilbert, M., & López, P. (2011) · Science · doi:10.1126/science.1200970 · Cited by 1,643
Adaptive Computation and Machine Learning
(2012) · Boosting · doi:10.7551/mitpress/8291.003.0026 · Cited by 1,402
Attacks on Steganographic Systems
Westfeld, A., & Pfitzmann, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10719724_5 · Cited by 934
Perceptual coding of digital audio
Painter, T., & Spanias, A. (2000) · Proceedings of the IEEE · doi:10.1109/5.842996 · Cited by 759
Edgebreaker: connectivity compression for triangle meshes
Rossignac, J. (1999) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.764870 · Cited by 670
Complex network approaches to nonlinear time series analysis
Zou, Y., Donner, R. V., Marwan, N., Donges, J. F., & Kurths, J. (2019) · Physics Reports · doi:10.1016/j.physrep.2018.10.005 · Cited by 634
A First Course in Information Theory
Yeung, R. W. (2002) · Information Technology: Transmission, Processing and Storage · doi:10.1007/978-1-4419-8608-5 · Cited by 533
Optical image compression and encryption methods
Alfalou, A., & Brosseau, C. (2009) · Advances in Optics and Photonics · doi:10.1364/aop.1.000589 · Cited by 504
Diagnosis of Alzheimers Disease from EEG Signals: Where Are We Standing?
Dauwels, J., Vialatte, F., & Cichocki, A. (2010) · Current Alzheimer Research · doi:10.2174/156720510792231720 · Cited by 492
Super-Scalar RAM-CPU Cache Compression
Zukowski, M., Heman, S., Nes, N., & Boncz, P. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.150 · Cited by 476
Implementing the PPM data compression scheme
Moffat, A. (1990) · IEEE Transactions on Communications · doi:10.1109/26.61469 · Cited by 420
Data compression algorithms for energy-constrained devices in delay tolerant networks
Sadler, C. M., & Martonosi, M. (2006) · Proceedings of the 4th international conference on Embedded networked sensor systems · doi:10.1145/1182807.1182834 · Cited by 418
Computer Intrusion: Detecting Masquerades
DuMouchel, W., Ju, W.-H., Karr, A. F., Schonlau, M., Theusan, M., & Vardi, Y. (2001) · Statistical Science · doi:10.1214/ss/998929476 · Cited by 378
Lelewer, D. A., & Hirschberg, D. S. (1987) · ACM Computing Surveys · doi:10.1145/45072.45074 · Cited by 377
Chen, F., Chandrakasan, A. P., & Stojanovic, V. M. (2012) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2011.2179451 · Cited by 376
Energy-aware lossless data compression
Barr, K. C., & Asanović, K. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1151690.1151692 · Cited by 346
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
Bhattacharya, A., & Das, S. K. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313457 · Cited by 307
Introduction to the special issue on computational linguistics using large corpora
Church, K., & Mercer, R. L. (1993) · OLAC - Open Language Archives Community · doi:10.5555/972450.972452 · Cited by 293
PRICE: Software for the Targeted Assembly of Components of (Meta) Genomic Sequence Data
Ruby, J. G., Bellare, P., & DeRisi, J. L. (2013) · G3 Genes|Genomes|Genetics · doi:10.1534/g3.113.005967 · Cited by 290
Viral Infection in Acute Exacerbation of Idiopathic Pulmonary Fibrosis
Wootton, S. C., Kim, D. S., Kondoh, Y., Chen, E., Lee, J. S., Song, J. W., Huh, J. W., Taniguchi, H., Chiu, C., Boushey, H., et al. (2011) · American Journal of Respiratory and Critical Care Medicine · doi:10.1164/rccm.201010-1752oc · Cited by 285
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
Three-dimensional subband coding of video
Podilchuk, C. I., Jayant, N. S., & Farvardin, N. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.342187 · Cited by 254
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
“Welch [8], on the Ziv-Lempel compression algorithm.”
MethodLeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
Bhattacharya, A., & Das, S. K. (2002) · Wireless Networks · doi:10.1023/a:1013759724438 · Cited by 205
“How to pick the right mobility model that does not impose fundamental restrictions in terms of richness?”
BackgroundA Large-scale Analysis of Hundreds of In-memory Key-value Cache Clusters at Twitter
Yang, J., Yue, Y., & Rashmi, K. V. (2021) · ACM Transactions on Storage · doi:10.1145/3468521 · Cited by 109
Whole-mouse clearing and imaging at the cellular level with vDISCO
Cai, R., Kolabas, Z. I., Pan, C., Mai, H., Zhao, S., Kaltenecker, D., Voigt, F. F., Molbay, M., Ohn, T.-L., Vincke, C., et al. (2023) · Nature Protocols · doi:10.1038/s41596-022-00788-2 · Cited by 83
Rawassizadeh (2023) · doi:10.1145/3569488 · Cited by 11
“The majority of text compression algorithm are lossless compression algorithms and they can be classified as either statistical-based approaches or dictionary-based approaches [72, 83].”
BackgroundHow Turing parasites expand the computational landscape of digital life
Seoane, L. F., & Solé, R. (2023) · Physical Review E · doi:10.1103/physreve.108.044407 · Cited by 8
Non-random structures in universal compression and the Fermi paradox
Gurzadyan, A. V., & Allahverdyan, A. E. (2016) · The European Physical Journal Plus · doi:10.1140/epjp/i2016-16026-6 · Cited by 2
ENEC: A Lossless AI Model Compression Method Enabling Fast Inference on Ascend NPUs
Yang, J., Wu, J., Liu, Z., Ma, X., Zhao, H., Gu, Y., Huang, Y., Liu, X., Huang, W., Wei, Z., et al. (2026) · 2026 ACM/IEEE 53rd Annual International Symposium on Computer Architecture (ISCA) · doi:10.1109/isca66397.2026.00100
Metadata
- Authors
- Welch
- Venue
- Computer
- Published
- 1984-06
- Volume
- 17
- Issue
- 6
- Pages
- 8-19
- ISSN
- 0018-9162 (ISSN-L)
- OpenAlex
- W1990653637
- Cited by
- 2,182
- References
- 3
- FWCI
- 9.83
- 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.