Compression of individual sequences via variable-rate coding
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Compressibility of individual sequences by the class of generalized finite-state information-lossless encoders is investigated. These encoders can operate in a variable-rate mode as well as a fixed-rate one, and they allow for any finite-state scheme of variable-length-to-variable-length coding. For every individual infinite sequencexa quantity\rho(x)is defined, called the compressibility ofx, which is shown to be the asymptotically attainable lower bound on the compression ratio that can be achieved forxby any finite-state encoder. This is demonstrated by means of a constructive coding theorem and its converse that, apart from their asymptotic significance, also provide useful performance criteria for finite and practical data-compression tasks. The proposed concept of compressibility is also shown to play a role analogous to that of entropy in classical information theory where one deals with probabilistic ensembles of sequences rather than with individual sequences. While the definition of\rho(x)allows a different machine for each different sequence to be compressed, the constructive coding theorem leads to a universal algorithm that is asymptotically optimal for all sequences.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“While these sequence prediction algorithms are able to predict the next activity that occurs in a sequence, they do not provide information about when that activity might occur.”
From Forecasting occurrences of activities (2017) · cites this paper as [3]
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
Self-citationInformation Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
On the Complexity of Finite Sequences
Lempel, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055501 · Cited by 2,717
Self-citationCoding theorems for individual sequences
Ziv, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055911 · Cited by 180
Self-citationOn Information Lossless Automata of Finite Order
Even, S. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.263996 · Cited by 76
Generalized automata and their information losslessness
Even, S. (1962) · Annual Symposium on Switching Circuit Theory and Logical Design (SWCT) · doi:10.1109/focs.1962.6 · Cited by 13
Cited by
Items 901–1,000 of 1,003
Building a better mousetrap: Compressing mouse cursor activity for web analytics
Leiva, L. A., & Huang, J. J. S. (2014) · Information Processing & Management · doi:10.1016/j.ipm.2014.10.005 · Cited by 20
On parsing optimality for dictionary-based text compression—the Zip case
Langiu, A. (2013) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2013.04.001 · Cited by 20
Universal Communication—Part I: Modulo Additive Channels
Lomnitz, Y., & Feder, M. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2266333 · Cited by 20
Improved Complexity Based on Time-Frequency Analysis in Bearing Quantitative Diagnosis
Wang, J., Cui, L., Wang, H., & Chen, P. (2013) · Advances in Mechanical Engineering · doi:10.1155/2013/258506 · Cited by 20
A location aided controlled spraying routing algorithm for Delay Tolerant Networks
Guo, H., Wang, X., Cheng, H., & Huang, M. (2017) · Ad Hoc Networks · doi:10.1016/j.adhoc.2017.08.005 · Cited by 20
Complexity-based permutation entropies: From deterministic time series to white noise
Amigó, J. M., Dale, R., & Tempesta, P. (2021) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2021.106077 · Cited by 20
Understanding Cache Compression
Carvalho, D. R., & Seznec, A. (2021) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3457207 · Cited by 20
{NVM} Compression—Hybrid Flash-Aware Application Level Compression
Das, D., Arteaga, D., Talagala, N., Mathiasen, T., & Lindström, J. (2014) · Cited by 20
Sampling automata and programs
Li, Q., & Dang, Z. (2015) · Theoretical Computer Science · doi:10.1016/j.tcs.2015.03.012 · Cited by 20
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
Bille, P., Fagerberg, R., & Gørtz, I. L. (2009) · ACM Transactions on Algorithms · doi:10.1145/1644015.1644018 · Cited by 20
A survey on novel classification of deduplication storage systems
Mohamed, S. M. A., & Wang, Y. (2020) · Distributed and Parallel Databases · doi:10.1007/s10619-020-07301-2 · Cited by 20
Exploring the Potential of Fast Delta Encoding: Marching to a Higher Compression Ratio
Tan, H., Zhang, Z., Zou, X., Liao, Q., & Xia, W. (2020) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster49012.2020.00030 · Cited by 20
Sayood, K. (2012) · Elsevier eBooks · doi:10.1016/b978-0-12-415796-5.00005-3 · Cited by 20
Ernst, J., Evans, W., Fraser, C. W., Proebsting, T. A., & Lucco, S. E. (1997) · ACM SIGPLAN Notices · doi:10.1145/258916.258947 · Cited by 20
Inplace 2D matching in compressed images
Amir, A., Landau, G. M., & Sokol, D. (2003) · Journal of Algorithms · doi:10.1016/s0196-6774(03)00088-9 · Cited by 20
PPM performance with BWT complexity: a fast and effective data compression algorithm
Effros, M. (2000) · Proceedings of the IEEE · doi:10.1109/5.892706 · Cited by 20
Linear-Time Text Compression by Longest-First Substitution
Nakamura, R., Inenaga, S., Bannai, H., Funamoto, T., Takeda, M., & Shinohara, A. (2009) · Algorithms · doi:10.3390/a2041429 · Cited by 20
Mehta, K., & Russell, B. (1989) · IEEE Power Engineering Review · doi:10.1109/mper.1989.4310804 · Cited by 20
In-place reconstruction of version differences
Burns, R. C., Stockmeyer, L. J., & Long, D. D. E. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1209013 · Cited by 20
Transcoding GIF images to JPEG-LS
Memon, N. D., & Rodila, R. (1997) · IEEE Transactions on Consumer Electronics · doi:10.1109/30.628652 · Cited by 20
Improving LZW (data compression algorithm)
Horspool, R. N. (2002) · DCC · doi:10.1109/dcc.1991.213347 · Cited by 20
Error-Resilient Optimal Data Compression
Storer, J. A., & Reif, J. H. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539792240789 · Cited by 20
Online adaptive vector quantization with variable size codebook entries
Constantinescu, C., & Storer, J. A. (1994) · Information Processing & Management · doi:10.1016/0306-4573(94)90003-5 · Cited by 20
New Compression Codes for Text Databases
Fariña, A. (2005) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 20
On the design and implementation of a lossless data compression and decompression chip
Royals, D. M., Markas, T., Kanopoulos, N., Reif, J. H., & Storer, J. A. (1993) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.236174 · Cited by 20
Measuring the complexity of musical rhythm
Thul, E. (2008) · eScholarship@McGill (McGill) · doi:10.82308/3390 · Cited by 20
Algorithms and compressed data structures for information retrieval
Ladra, S. (2012) · Tesis Doctorals en Xarxa (Consorci de Serveis Universitaris de Catalunya) · Cited by 20
Complexity and Entropy in Legal Language
Friedrich, R. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.671882 · Cited by 19
“A derived complexity measure is the compression factor, which we consider next, and which is obtained from a lossless compression algorithm, such as, [15, 16].”
MethodOu, X., Chen, Z., Zhu, C., & Liu, Y. (2023) · Journal of Systems Engineering and Electronics · doi:10.23919/jsee.2023.000159 · Cited by 19
Autoencoder-based image compression for wireless sensor networks
Lungisani, B. A., Zungeru, A. M., Lebekwe, C. K., & Yahya, A. (2024) · Scientific African · doi:10.1016/j.sciaf.2024.e02159 · Cited by 19
Data Discovery and Anomaly Detection Using Atypicality for Real-Valued Data
Sabeti, E., & Høst-Madsen, A. (2019) · Entropy · doi:10.3390/e21030219 · Cited by 19
Unlocking the Power of Numbers: Log Compression via Numeric Token Parsing
Yu, S., Wu, Y., Li, Y., & He, P. (2024) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1145/3691620.3695474 · Cited by 19
An adaptive trajectory compression and feature preservation method for maritime traffic analysis
Guo, S., Bolbot, V., & Banda, O. A. V. (2024) · Ocean Engineering · doi:10.1016/j.oceaneng.2024.119189 · Cited by 19
Discrete Denoising With Shifts
Moon, T., & Weissman, T. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030461 · Cited by 19
Cho, G.-Y., Lee, G.-Y., & Lee, T.-R. (2017) · Applied Sciences · doi:10.3390/app7040366 · Cited by 19
The Lempel–Ziv Complexity of Fixed Points of Morphisms
Constantinescu, S., & Ilie, L. (2007) · SIAM Journal on Discrete Mathematics · doi:10.1137/050646846 · Cited by 19
Partition and Code: learning how to compress graphsPreprint
Bouritsas, G., Loukas, A., Karalias, N., & Bronstein, M. M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.01952 · Cited by 19
Lin, F., Chen, J., Ding, G., & Jiao, Y. (2023) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2023.3329354 · Cited by 19
A predictive approach to achieving consistency in cooperative caching in MANET
Huang, Y., Cao, J., & Jin, B. (2006) · Scalable Information Systems · doi:10.1145/1146847.1146898 · Cited by 19
Open-Endedness for the Sake of Open-Endedness
Hintze, A. (2019) · Artificial Life · doi:10.1162/artl_a_00289 · Cited by 19
Differential direct coding: a compression algorithm for nucleotide sequence data
Vey, G. (2009) · Database · doi:10.1093/database/bap013 · Cited by 19
OPTIMIZING LEMPEL-ZIV FACTORIZATION FOR THE GPU ARCHITECTURE
Ching, B. (2014) · DigitalCommons - CalPoly (California State Polytechnic University) · doi:10.15368/theses.2014.83 · Cited by 19
On the bit-complexity of Lempel-Ziv compression
Ferragina, P., Nitto, I., & Venturini, R. (2009) · CINECA IRIS Institutial research information system (University of Pisa) · doi:10.5555/1496770.1496854 · Cited by 19
Detecting Known and New Salting Tricks in Unwanted Emails.
Bergholz, A., Paaß, G., Reichartz, F., Strobel, S., Moens, M., & Witten, B. (2008) · Lirias · Cited by 19
Computing absolutely normal numbers in nearly linear time
Lutz, J. H., & Mayordomo, E. (2021) · Information and Computation · doi:10.1016/j.ic.2021.104746 · Cited by 19
Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition
Huang, Y., Yang, L., & Wang, T. (2010) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2010.10.027 · Cited by 19
A Model Conditioned Data Compression Based Similarity Measure
Cerra, D., & Datcu, M. P. (2008) · DCC · doi:10.1109/dcc.2008.46 · Cited by 19
Fast Text Compression Using Multiple Static Dictionaries
Carus, A., & Mesut, A. (2010) · Information Technology Journal · doi:10.3923/itj.2010.1013.1021 · Cited by 19
Transfer entropy rate through Lempel-Ziv complexity
Restrepo, J. F., Mateos, D. M., & Schlotthauer, G. (2020) · Physical review. E · doi:10.1103/physreve.101.052117 · Cited by 19
Variable-to-fixed length codes for predictable sources
Savari, S. A. (2002) · DCC · doi:10.1109/dcc.1998.672213 · Cited by 19
Lossy Compression of Packet Classifiers
Rottenstreich, O., & Tapolcai, J. (2015) · Architectures for Networking and Communications Systems · doi:10.5555/2772722.2772731 · Cited by 19
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
Takagi, T., Inenaga, S., Sadakane, K., & Arimura, H. (2017) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e100.a.1785 · Cited by 19
Color image steganography scheme using gray invariant in AMBTC compression domain
Kumar, R., Kumar, N., & Jung, K. (2020) · Multidimensional Systems and Signal Processing · doi:10.1007/s11045-020-00701-8 · Cited by 19
Information Theoretic Text Classification Using the Ziv-Merhav Method
Coutinho, D., & Figueiredo, M. A. T. (2005) · Lecture notes in computer science · doi:10.1007/11492542_44 · Cited by 19
Doty, D. S., & Moser, P. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73001-9_24 · Cited by 19
Resource Requirements for the Application of Addition Chains in Modulo Exponentiation
Sauerbrey, J., & Dietel, A. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_15 · Cited by 19
Motifs in ziv-Lempel-Welch clef
Apostolico, A., Comin, M., & Parida, L. (2004) · DCC · doi:10.1109/dcc.2004.1281452 · Cited by 19
Sort order preserving data compression for extended alphabets
Zandi, A., Iyer, B. R., & Langdon, G. G. (2002) · DCC · doi:10.1109/dcc.1993.253116 · Cited by 19
Supervised And Unsupervised Sequence Modelling For Drum Transcription.
Gillet, O., & Richard, G. (2007) · HAL · doi:10.5281/zenodo.1417236 · Cited by 19
Automatic main melody extraction from midi files with a modified Lempel-Ziv algorithm
Shih, H.-H., Narayanan, S. S., & Kuo, C. ‐. J. (2002) · International Symposium on Intelligent Multimedia, Video and Speech Processing · doi:10.1109/isimp.2001.925317 · Cited by 19
Fixed-length entropy coding for robust video compression
Llados-Bernaus, R., & Stevenson, R. L. (1998) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.728418 · Cited by 19
On the validity of a model for the reversals of the Earth's magnetic field
Witt, A., Kurths, J., Krause, F., & Fischer, K. (1994) · Geophysical & Astrophysical Fluid Dynamics · doi:10.1080/03091929408203676 · Cited by 19
Dubin, R., Dvir, A. Z., Pele, O., Hadar, O., Richman, I., & Trabelsi, O. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.00489 · Cited by 19
How well do practical information measures estimate the Shannon entropy
Speidel, U., Titchener, M. R., & Jia, Y. (2006) · ResearchSpace (University of Auckland) · Cited by 18
A Randomness Test Based on T-Complexity
Hamano, K., & Yamamoto, H. (2010) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e93.a.1346 · Cited by 18
LSD flattens the hierarchy of directed information flow in fast whole-brain dynamics
Shinozuka, K., Tewarie, P. K. B., Luppi, A. I., Lynn, C. W., Roseman, L., Muthukumaraswamy, S. D., Nutt, D. J., Carhart-Harris, R. L., Deco, G., & Kringelbach, M. L. (2025) · Imaging Neuroscience · doi:10.1162/imag_a_00420 · Cited by 18
Using alignment-free and pattern mining methods for SARS-CoV-2 genome analysis
Nawaz, M. S., Fournier‐Viger, P., Aslam, M., Li, W., He, Y., & Niu, X. (2023) · Applied Intelligence · doi:10.1007/s10489-023-04618-0 · Cited by 18
Variance estimators for the Lempel-Ziv entropy rate estimator
Amigó, J. M., & Kennel, M. B. (2006) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.2347102 · Cited by 18
Paluš, M. (2017) · Springer eBooks · doi:10.1007/978-3-319-58895-7_21 · Cited by 18
The rising entropy of English in the attention economy
Pilgrim, C., Guo, W., & Hills, T. T. (2024) · Communications Psychology · doi:10.1038/s44271-024-00117-1 · Cited by 18
Text Classification Using Compression-Based Dissimilarity Measures
Coutinho, D., & Figueiredo, M. A. T. (2015) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001415530043 · Cited by 18
The Compression Optimality of Asymmetric Numeral Systems
Pieprzyk, J., Duda, J., Pawlowski, M. P., Camtepe, S. A., Mahboubi, A., & Morawiecki, P. (2023) · Entropy · doi:10.3390/e25040672 · Cited by 18
On the Inability of Markov Models to Capture Criticality in Human Mobility
Kulkarni, V., Mahalunkar, A., Garbinato, B., & Kelleher, J. D. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-30508-6_39 · Cited by 18
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms
Giancarlo, R., & Sciortino, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44888-8_10 · Cited by 18
Mutual information and redundancy in spontaneous communication between cortical neurons
Szczepański, J., ARNOLD, M. M., Wajnryb, E., Amigó, J. M., & Sanchez-Vives, M. V. (2011) · Biological Cybernetics · doi:10.1007/s00422-011-0425-y · Cited by 18
CHICO: A Compressed Hybrid Index for Repetitive Collections
Valenzuela, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-38851-9_22 · Cited by 18
In Place Differential File Compression
Shapira, D., & Storer, J. A. (2005) · The Computer Journal · doi:10.1093/comjnl/bxh128 · Cited by 18
Cook, D. J., Youngblood, G. M., & Jain, G. (2008) · Wiley eBooks · doi:10.1002/9780470379424.ch42 · Cited by 18
Universal prediction of random binary sequences in a noisy environment
Weissman, T., & Merhav, N. (2004) · The Annals of Applied Probability · doi:10.1214/aoap/1075828047 · Cited by 18
Memory-efficient groupby-aggregate using compressed buffer trees
Amur, H., Richter, W., Andersen, D. G., Kaminsky, M., Schwan, K., Balachandran, A., & Zawadzki, E. (2013) · Symposium on Cloud Computing · doi:10.1145/2523616.2523625 · Cited by 18
Burrows–Wheeler compression: Principles and reflections
Fenwick, P. M. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.07.012 · Cited by 18
Lathrop, J. I., & Strauss, M. (2002) · Compression and Complexity of Sequences (SEQUENCES) · doi:10.1109/sequen.1997.666909 · Cited by 18
Homomorphic Compression: Making Text Processing on Compression Unlimited
Guan, J., Zhang, F., Ma, S., Chen, K., Hu, Y., Chen, Y., Pan, A., & Du, X. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3626765 · Cited by 18
Cai, Z., & Sun, J. (2009) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127409023408 · Cited by 18
Yang, E., He, D., Uyematsu, T., & Yeung, R. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2006449 · Cited by 18
Succinct 2D Dictionary Matching
Neuburger, S., & Sokol, D. (2012) · Algorithmica · doi:10.1007/s00453-012-9615-9 · Cited by 18
The Smallest Grammar Problem Revisited
Bannai, H., Hirayama, M., Hucke, D., Inenaga, S., Jeż, A., Lohrey, M., & Reh, C. P. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3038147 · Cited by 18
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition
Tiskin, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20712-9_32 · Cited by 18
The relative efficiency of data compression by LZW and LZSS
Wiseman, Y. (2007) · Data Science Journal · doi:10.2481/dsj.6.1 · Cited by 18
Practical and flexible pattern matching over Ziv–Lempel compressed text
Navarro, G., & Raffinot, M. (2004) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2003.12.002 · Cited by 18
Non-sequential recursive pair substitution: some rigorous results
Benedetto, D., Caglioti, E., & Gabrielli, D. (2006) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2006/09/p09011 · Cited by 18
Twice-Universal Simulation of Markov Sources and Individual Sequences
Martin, Á., Merhav, N., Seroussi, G., & Weinberger, M. J. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2053870 · Cited by 18
Bicriteria Data Compression: Efficient and Usable
Farruggia, A., Ferragina, P., & Venturini, R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44777-2_34 · Cited by 18
Workload-Optimal Histograms on Streams
Muthukrishnan, S., Strauss, M., & Zheng, X. (2005) · Lecture notes in computer science · doi:10.1007/11561071_65 · Cited by 18
Improving Middleware Performance with AdOC: An Adaptive Online Compression Library for Data Transfer
Jeannot, E. (2005) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2005.254 · Cited by 18
Compressed double-array tries for string dictionaries supporting fast lookup
Kanda, S., Morita, K., & Fuketa, M. (2016) · Knowledge and Information Systems · doi:10.1007/s10115-016-0999-8 · Cited by 18
Zeeh, C. (2003) · Cited by 18
NONLINEAR SIGNAL CLASSIFICATION
Rapp, P. E., Watanabe, T., Fauré, P., & Cellucci, C. J. (2002) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812740200508x · Cited by 18
Automatic synthesis of compression techniques for heterogeneous files
Hsu, W. H., & Zwarico, A. E. (1995) · Software Practice and Experience · doi:10.1002/spe.4380251003 · Cited by 18
Parsing algorithms for dictionary compression on the PRAM
Hirschberg, D. S., & Stauffer, L. M. (2002) · DCC · doi:10.1109/dcc.1994.305921 · Cited by 18
Metadata
- Authors
- Ziv, J., & Lempel, A.
- Affiliations
- AT&T (United States) (US)
- Technion – Israel Institute of Technology (IL)
- Venue
- IEEE Transactions on Information Theory
- Published
- 1978-09
- Volume
- 24
- Issue
- 5
- Pages
- 530-536
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2122962290
- Cited by
- 3,432
- References
- 7
- Citations by year
- 2026: 53 · 2025: 79 · 2024: 76 · 2023: 74 · 2022: 72 · 2021: 106 · 2020: 122 · 2019: 137 · 2018: 92 · 2017: 121 · 2016: 102 · 2015: 108 · 2014: 150 · 2013: 144 · 2012: 136
- FWCI
- 2.08
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Keywords
- variable-rate coding, compressibility, universal compression
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.