A universal algorithm for sequential data compression
Abstract
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cited by
Sorted by citations
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · see citing works
Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867 · see citing works
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 · see citing works
Autonomy of Autonomic Dysfunction in Major Depression
Koschke, M., Boettger, M. K., Schulz, S., Berger, S., Terhaar, J., Voss, A., Yeragani, V. K., & Bär, K.-J. (2009) · Psychosomatic Medicine · doi:10.1097/psy.0b013e3181b8bb7a · Cited by 199 · see citing works
Bär, K.-J. (2015) · Frontiers in Neurology · doi:10.3389/fneur.2015.00139 · Cited by 71 · see citing works
Statistical Patterns in Written Language
Zanette, D. H. (2014) · arXiv · doi:10.48550/arxiv.1412.3336 · Cited by 25 · see citing works
Complexity and Entropy in Legal Language
Friedrich, R. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.671882 · Cited by 19 · see citing works
Detecting translations of the same text and data with common source
Koroutchev, K., & Cebrián, M. (2006) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2006/10/p10009 · Cited by 9 · see citing works
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 · see citing works
Lossless Token Sequence Compression via Meta-Tokens
Harvill, J., Fan, Z., Wang, H., Huan, L., Deoras, A., Sun, Y., & Ding, H. (2025) · arXiv · doi:10.48550/arxiv.2506.00307
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
- Authors
- Ziv, J., & Lempel, A.
- Affiliations
- Technion – Israel Institute of Technology (IL)
- Venue
- IEEE Transactions on Information Theory
- Published
- 1977-05
- Volume
- 23
- Issue
- 3
- Pages
- 337-343
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2107745473
- Cited by
- 5,456
- References
- 0
- Citations by year
- 2026: 131 · 2025: 163 · 2024: 154 · 2023: 167 · 2022: 138 · 2021: 171 · 2020: 189 · 2019: 194 · 2018: 196 · 2017: 238 · 2016: 200 · 2015: 230 · 2014: 217 · 2013: 217 · 2012: 218
- FWCI
- 2.94
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Keywords
- universal compression, universal coding, source matching
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
