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 701–800 of 1,003
String Matching with Stopper Encoding and Code Splitting
Rautio, J., Tanninen, J., & Tarhio, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45452-7_5 · Cited by 29
Lossless Data Compression via Substring Enumeration
Dubé, D., & Beaudoin, V. (2010) · DCC · doi:10.1109/dcc.2010.28 · Cited by 29
Rizzo, F., Storer, J. A., & Carpentieri, B. (2001) · Information Sciences · doi:10.1016/s0020-0255(01)00104-9 · Cited by 29
Real-Time Lossless Compression for Silicon Debug
Daoud, E. A., & Nicolici, N. (2009) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2009.2023198 · Cited by 29
Unified Compression-Based Acceleration of Edit-Distance Computation
Hermelin, D., Landau, G. M., Landau, S., & Weimann, O. (2011) · Algorithmica · doi:10.1007/s00453-011-9590-6 · Cited by 29
Improving application performance through swap compression
Cervera, R., Cortés, T., & Becerra, Y. (1999) · USENIX Annual Technical Conference · Cited by 29
Block arithmetic coding for source compression
Boncelet, C. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259639 · Cited by 29
Size and path length of Patricia tries: Dynamical sources context
Bourdon, J. (2001) · Random Structures and Algorithms · doi:10.1002/rsa.10015 · Cited by 29
Efficient VLSI for Lempel-Ziv compression in wireless data communication networks
Jung, B., & Burleson, W. P. (1998) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.711318 · Cited by 29
Data Discovery and Anomaly Detection Using Atypicality: Theory
Høst-Madsen, A., Sabeti, E., & Walton, C. B. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2917669 · Cited by 28
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
Kieffer, J. C., & Yang, E. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481775 · Cited by 28
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
Shun, J. (2017) · doi:10.1145/3018787 · Cited by 28
Knessl, C., & Szpankowski, W. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539799356812 · Cited by 28
Space-efficient construction of Lempel–Ziv compressed text indexes
Arroyuelo, D., & Navarro, G. (2011) · Information and Computation · doi:10.1016/j.ic.2011.03.001 · Cited by 28
Lempel Ziv Computation in Small Space (LZ-CISS)
Fischer, J., Tomohiro, I., & Köppl, D. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19929-0_15 · Cited by 28
Lempel-Ziv Computation in Compressed Space (LZ-CICS)
Köppl, D., & Sadakane, K. (2016) · DCC · doi:10.1109/dcc.2016.38 · Cited by 28
General-purpose compression for efficient retrieval
Cannane, A., & Williams, H. E. (2001) · Journal of the American Society for Information Science and Technology · doi:10.1002/1532-2890(2001)9999:9999<::aid-asi1084>3.0.co;2-z · Cited by 28
Scanned Compound Document Encoding Using Multiscale Recurrent Patterns
Francisco, N., Rodrigues, N. M. M., da Silva, E. A. B., Carvalho, M. B. D., de Faria, S. M. M., & da Silva, V. M. M. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2049181 · Cited by 28
Effective Fractal Dimension in Algorithmic Information Theory
Mayordomo, E. (2007) · Springer eBooks · doi:10.1007/978-0-387-68546-5_12 · Cited by 28
A New Architecture of a Two-Stage Lossless Data Compression and Decompression Algorithm
Lin, M.-B., & Chang, Y.-Y. (2009) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2008.2003512 · Cited by 28
Lossy compression of packet classifiers
Rottenstreich, O., & Tapolcai, J. (2015) · ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) · doi:10.1109/ancs.2015.7110119 · Cited by 28
Compression of associated signaling for adaptive multi-carrier systems
Nguyen, H., Brouet, J., Kumar, V., & Lestable, T. (2005) · IEEE Vehicular Technology Conference · doi:10.1109/vetecs.2004.1390607 · Cited by 28
Merhav, N., & Neuhoff, D. L. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.108258 · Cited by 28
Compror: On-line lossless data compression with a factor oracle
Lefebvre, A., & Lecroq, T. (2002) · Information Processing Letters · doi:10.1016/s0020-0190(01)00308-8 · Cited by 28
Mehta, K., & Russell, B. (1989) · IEEE Transactions on Power Delivery · doi:10.1109/61.32659 · Cited by 28
High-resolution still picture compression
Wickerhauser, M. V. (1992) · Digital Signal Processing · doi:10.1016/1051-2004(92)90010-v · Cited by 28
On-line versus off-line computation in dynamic text compression
Agostino, S. D., & Storer, J. A. (1996) · Information Processing Letters · doi:10.1016/0020-0190(96)00068-3 · Cited by 28
Reduced complexity maximum a posteriori decoding of variable-length codes
Lamy, C., & Pothier, O. (2002) · Globecom · doi:10.1109/glocom.2001.965727 · Cited by 28
Kimiskidis, V. Κ., Koutlis, C., Tsimpiris, A., Kälviäinen, R. K., Ryvlin, P., & Kugiumtzis, D. (2015) · International Journal of Neural Systems · doi:10.1142/s0129065715500185 · Cited by 27
Guessing Based On Length Functions
Sundaresan, R. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557309 · Cited by 27
B'MOJO: Hybrid State Space Realizations of Foundation Models with Eidetic and Fading Memory
Zancato, L., Seshadri, A., Dukler, Y., Golatkar, A., Shen, Y., Bowman, B., Trager, M., Achille, A., & Soatto, S. (2024) · neural information processing systems · doi:10.52202/079017-4145 · Cited by 27
Entropy-constrained halftoning using multipath tree coding
Wong, P. W. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.641416 · Cited by 27
Pass-efficient methods for compression of high-dimensional turbulent flow data
Dunton, A. M., Jofre, L., Iaccarino, G., & Doostan, A. (2020) · Journal of Computational Physics · doi:10.1016/j.jcp.2020.109704 · Cited by 27
Misra, A., Roy, A., & Das, S. K. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.901067 · Cited by 27
Implementing the LZ-index: Theory versus practice
Navarro, G. (2009) · ACM Journal of Experimental Algorithmics · doi:10.1145/1412228.1412230 · Cited by 27
Fingerprints, Iris and DNA Features based Multimodal Systems: A Review
Srivastava, P. C., Agrawal, A., Mishra, K. N., Ojha, P. K., & Garg, R. (2013) · International Journal of Information Technology and Computer Science · doi:10.5815/ijitcs.2013.02.10 · Cited by 27
Seamlessly Engineering a Smart Environment
Youngblood, G. M., Cook, D. J., & Holder, L. B. (2006) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2005.1571203 · Cited by 27
Gradient Equilibrium in Online Learning: Theory and ApplicationsPreprint
Angelopoulos, A. N., Jordan, M. I., & Tibshirani, R. J. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2501.08330 · Cited by 27
When do Software Complexity Metrics Mean Nothing? – When Examined out of Context.
Gil, J. (., & Lalouche, G. (2016) · The Journal of Object Technology · doi:10.5381/jot.2016.15.1.a2 · Cited by 27
Extending Context Spaces Theory by Predicting Run-Time Context
Boytsov, A., Zaslavsky, A., & Synnes, K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04190-7_2 · Cited by 27
Faster Approximate Pattern Matching: A Unified Approach
Charalampopoulos, P., Kociumaka, T., & Wellnitz, P. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00095 · Cited by 27
Word-Based Compression Methods and Indexing for Text Retrieval Systems
Dvorský, J., Pokorný, J., & Snåšel, V. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48252-0_6 · Cited by 27
SDGen: mimicking datasets for content generation in storage benchmarks
Gracia-Tinedo, R., Harnik, D., Naor, D., Sotnikov, D. V., Toledo, S., & Zuck, A. (2015) · File and Storage Technologies · doi:10.5555/2750482.2750506 · Cited by 27
Universal detection of messages via finite-state channels
Merhav, N. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.868498 · Cited by 27
Nguyen, V., Nguyen, H. P. N., Duong, H. N., & Snåšel, V. (2016) · Computational Intelligence and Neuroscience · doi:10.1155/2016/9483646 · Cited by 27
An Efficient Encoding Algorithm Using Local Path on Huffman Encoding Algorithm for Compression
Erdal, E., & Ergüzen, A. (2019) · Applied Sciences · doi:10.3390/app9040782 · Cited by 27
On the symmetric information rate of two-dimensional finite-state ISI channels
Chen, J., & Siegel, P. H. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860467 · Cited by 27
Lempel-Ziv compression of structured text
Adiego, J., Navarro, G., & de la Fuente, P. (2004) · DCC · doi:10.1109/dcc.2004.1281456 · Cited by 27
The Lempel-Ziv algorithm and message complexity
Gilbert, E. N., & Kadota, T. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.165463 · Cited by 27
A Software Library in ANSI C for Empirical Testing of Random Number Generators
Simard, R. (2013) · Cited by 26
Quantifiers satisfying semantic universals have shorter minimal description length
van de Pol, I., Lodder, P., van Maanen, L., Steinert‐Threlkeld, S., & Szymanik, J. (2022) · Cognition · doi:10.1016/j.cognition.2022.105150 · Cited by 26
Deep Lossless Compression Algorithm Based on Arithmetic Coding for Power Data
Ma, Z., Zhu, H., he, Z., Lu, Y., & Song, F. (2022) · Sensors · doi:10.3390/s22145331 · Cited by 26
Practical prefetching via data compression
Curewitz, K. M., Krishnan, P., & Vitter, J. S. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170077 · Cited by 26
A non-parametric symbolic approximate representation for long time series
He, X., Shao, C., & Xiong, Y. (2014) · Pattern Analysis and Applications · doi:10.1007/s10044-014-0395-5 · Cited by 26
CompressStreamDB: Fine-Grained Adaptive Stream Processing without Decompression
Zhang, Y., Zhang, F., Li, H., Zhang, S., & Du, X. (2023) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde55515.2023.00038 · Cited by 26
Universal Prediction Applied to Stylistic Music Generation
Dubnov, S., & Assayag, G. (2002) · Springer eBooks · doi:10.1007/978-3-662-04927-3_9 · Cited by 26
Two-dimensional encoding by finite-state encoders
Sheinwald, D., Lempel, A., & Ziv, J. (1990) · IEEE Transactions on Communications · doi:10.1109/26.48892 · Cited by 26
Self-citationLZ-Compressed String Dictionaries
Arz, J., & Fischer, J. (2014) · DCC · doi:10.1109/dcc.2014.36 · Cited by 26
Licciardo, G. D., & Albanese, L. F. (2012) · IET Image Processing · doi:10.1049/iet-ipr.2010.0510 · Cited by 26
Increasing the efficiency of information transmission in communication channels
Жураковський, Б. Ю., Boiko, J., Druzhynin, V., Zeniv, I., & Eromenko, O. (2020) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v19.i3.pp1306-1315 · Cited by 26
Database compression techniques for performance optimization
Palwe, S. (2010) · International Conference on Computer Engineering and Technology · doi:10.1109/iccet.2010.5485951 · Cited by 26
Universal Image Compression Using Multiscale Recurrent Patterns With Adaptive Probability Model
Filho, E. B. D. L., da Silva, E. A. B., Carvalho, M. B. D., & Pinagé, F. S. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.918042 · Cited by 26
Compressing Genomic Sequence Fragments Using SlimGene
Kozanitis, C., Saunders, C. T., Kruglyak, S., Bafna, V., & Varghese, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12683-3_20 · Cited by 26
Fast distance multiplication of unit-Monge matrices
Tiskin, A. (2026) · Warwick Research Archive Portal (University of Warwick) · doi:10.82444/warw.33496630 · Cited by 26
An adaptive character wordlength algorithm for data compression
Al-Bahadili, H., & Hussain, S. M. (2007) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2007.05.014 · Cited by 26
Ryabko, B. Y. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144725 · Cited by 26
Parallel algorithms for optimal compression using dictionaries with the prefix property
Agostino, S. D., & Storer, J. A. (2003) · DCC · doi:10.1109/dcc.1992.227476 · Cited by 26
Computational information for the logistic map at the chaos threshold
Bonanno, C., & Menconi, G. (2002) · Discrete and Continuous Dynamical Systems - B · doi:10.3934/dcdsb.2002.2.415 · Cited by 26
A differential lossless image compression scheme
Sayood, K., & Anderson, K. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.157204 · Cited by 26
Condition Monitoring and Fault Diagnosis of Roller Element Bearing
Lin, T. R., Yu, K., & Tan, J. (2017) · InTech eBooks · doi:10.5772/67143 · Cited by 25
Mapping efficiency and information content
Hengl, T., Nikolić, M., & MacMillan, R. A. (2012) · International Journal of Applied Earth Observation and Geoinformation · doi:10.1016/j.jag.2012.02.005 · Cited by 25
Artificial sequences and complexity measures
Baronchelli, A., Caglioti, E., & Loreto, V. (2005) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2005/04/p04002 · Cited by 25
Authentication of LZ-77 compressed data
Atallah, M. J., & Lonardi, S. (2003) · ACM Symposium on Applied Computing · doi:10.1145/952532.952591 · Cited by 25
Universal Compressed Sensing for Almost Lossless Recovery
Jalali, S., & Poor, H. V. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2672754 · Cited by 25
A hybrid memory built by SSD and DRAM to support in-memory Big Data analytics
Chen, Z., Lu, Y., Xiao, N., & Liu, F. (2014) · Knowledge and Information Systems · doi:10.1007/s10115-013-0727-6 · Cited by 25
A Review on Medical Image Data Compression Techniques
Patidar, G., Kumar, S., & Kumar, D. (2020) · International Conference on Data, Engineering and Applications (IDEA) · doi:10.1109/idea49133.2020.9170679 · Cited by 25
Wyner–Ziv Video Coding With Universal Prediction
Li, Z., Liu, L., & Delp, E. J. (2006) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2006.883511 · Cited by 25
Lempel–Ziv Data Compression on Parallel and Distributed Systems
Agostino, S. D. (2011) · Algorithms · doi:10.3390/a4030183 · Cited by 25
Efficient LZ78 Factorization of Grammar Compressed Text
Bannai, H., Inenaga, S., & Takeda, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34109-0_10 · Cited by 25
Opportunistic Source Coding for Data Gathering in Wireless Sensor Networks
Cui, T., Chen, L., Ho, T., Low, S. H., & Andrew, L. L. H. (2007) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mobhoc.2007.4428675 · Cited by 25
Korabel, N., & Barkai, E. (2010) · Physical Review E · doi:10.1103/physreve.82.016209 · Cited by 25
An information‐theoretic approach to the prediction of protein structural class
Zheng, X., Li, C., & Wang, J. (2009) · Journal of Computational Chemistry · doi:10.1002/jcc.21406 · Cited by 25
Malicious URL Detection Based on Kolmogorov Complexity Estimation
Pao, H.-K., Chou, Y.-L., & Lee, Y. (2012) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wi-iat.2012.258 · Cited by 25
Parsing with suffix and prefix dictionaries
Cohn, M., & Khazan, R. I. (2002) · DCC · doi:10.1109/dcc.1996.488323 · Cited by 25
Klein, S. T., & Wiseman, Y. (2002) · DCC · doi:10.1109/dcc.2000.838178 · Cited by 25
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding
Goto, K., Bannai, H., Inenaga, S., & Takeda, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19929-0_19 · Cited by 25
PPM performance with BWT complexity: a new method for lossless data compression
Effros, M. (2002) · DCC · doi:10.1109/dcc.2000.838160 · Cited by 25
Compression, information theory, and grammars: a unified approach
Bookstein, A., & Klein, S. T. (1990) · ACM Transactions on Information Systems · doi:10.1145/78915.78917 · Cited by 25
On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
Yang, E., & Kieffer, J. C. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.605570 · Cited by 25
A robust approach to sequence classification
Li, M., & Sleep, R. (2005) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2005.16 · Cited by 25
Extended Bit-Plane Compression for Convolutional Neural Network Accelerators
Cavigelli, L., & Benini, L. (2019) · IEEE International Conference on Artificial Intelligence Circuits and Systems (AICAS) · doi:10.1109/aicas.2019.8771562 · Cited by 24
Compression of Samplable Sources
Trevisan, L., Vadhan, S., & Zuckerman, D. (2005) · Computational Complexity · doi:10.1007/s00037-005-0198-6 · Cited by 24
Tian, Y., Zhang, H., Jiang, Y., Li, P., & Li, Y. (2019) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2019.2936997 · Cited by 24
Sequence complexity and work extraction
Merhav, N. (2015) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2015/06/p06037 · Cited by 24
Effective Construction of Relative Lempel-Ziv Dictionaries
Liao, K., Petri, M., Moffat, A., & Wirth, A. I. (2016) · International World Wide Web Conference (WWW) · doi:10.1145/2872427.2883042 · Cited by 24
Universal sequential learning and decision from individual data sequences
Merhav, N., & Feder, M. (1992) · Conference on Learning Theory · doi:10.1145/130385.130430 · Cited by 24
Understanding LLM Behaviors via Compression: Data Generation, Knowledge Acquisition and Scaling Laws
Pan, Z., Wang, S., Pengfei, L., & Li, J. (2025) · neural information processing systems · doi:10.52202/085713-5613 · Cited by 24
Scanning and Sequential Decision Making for Multidimensional Data—Part II: The Noisy Case
Cohen, A., Weissman, T., & Merhav, N. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2006378 · Cited by 24
A Succinct Grammar Compression
Tabei, Y., Takabatake, Y., & Sakamoto, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38905-4_23 · Cited by 24
A generic post-deblocking filter for block based image compression algorithms
Francisco, N., Rodrigues, N. M. M., da Silva, E. A. B., & de Faria, S. M. M. (2012) · Signal Processing Image Communication · doi:10.1016/j.image.2012.05.005 · Cited by 24
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.