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 801–900 of 1,003
Constructing LZ78 tries and position heaps in linear time for large alphabets
Nakashima, Y., Tomohiro, I., Inenaga, S., Bannai, H., & Takeda, M. (2015) · Information Processing Letters · doi:10.1016/j.ipl.2015.04.002 · Cited by 24
Liu, Z., Saifullah, Y., Greis, M., & Sreemanthula, S. (2005) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2005.1424906 · Cited by 24
Network security through conservation of complexity
Evans, S. C., & Barnett, B. (2003) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom.2002.1179637 · Cited by 24
Faster subsequence recognition in compressed strings
Tiskin, A. (2009) · Journal of Mathematical Sciences · doi:10.1007/s10958-009-9396-0 · Cited by 24
Performance of LZ algorithms on individual sequences
Shields, P. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.761286 · Cited by 24
Optimization of html automatically generated by wysiwyg programs
Spiesser, J., & Kitchen, L. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/988672.988720 · Cited by 24
Hierarchyless Simplification, Stripification and Compression of Triangulated Two‐Manifolds
Diaz‐Gutierrez, P., Gopi, M., & Pajarola, R. (2005) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2005.00871.x · Cited by 24
Error-Resilient LZW Data Compression
Wu, Y., Lonardi, S., & Szpankowski, W. (2006) · DCC · doi:10.1109/dcc.2006.33 · Cited by 24
A novel lossless data compression scheme based on the error correcting Hamming codes
Al-Bahadili, H. (2008) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2007.11.043 · Cited by 24
Redundancy of the Lempel-Ziv string matching code
Savari, S. A. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661522 · Cited by 24
Variable-to-fixed length codes and the conservation of entropy
Savari, S. A. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771231 · Cited by 24
Reznik, Y. A. (2011) · DCC · doi:10.1109/dcc.2011.12 · Cited by 23
The Impact of Spatial Resolution and Representation on Human Mobility Predictability
Qian, W., Stanley, K. G., & Osgood, N. D. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37087-8_3 · Cited by 23
Compressed Sensing with Applications in Wireless Networks
Leinonen, M., Codreanu, M., & Giannakis, G. B. (2019) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000107 · Cited by 23
Abrahão, F. S., Hernández-Orozco, S., Kiani, N. A., Tegner, J. N., & Zenil, H. (2024) · PLOS complex systems. · doi:10.1371/journal.pcsy.0000014 · Cited by 23
StegCure: a comprehensive steganographic tool using enhanced LSB scheme
Por, L. Y., Lai, W. K., Alireza, Z., Ang, T. F., Su, M. T., & Delina, B. (2008) · WSEAS Transactions on Computers archive · Cited by 23
Compression of Spectral Images
Kaarna, A. (2007) · doi:10.5772/4964 · Cited by 23
A Lempel-Ziv Text Index on Secondary Storage
Arroyuelo, D., & Navarro, G. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73437-6_11 · Cited by 23
Fast profile matching algorithms — A survey
Pizzi, C., & Ukkonen, E. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.01.015 · Cited by 23
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
Casel, K., Fernau, H., Gaspers, S., Gras, B., & Schmid, M. L. (2020) · Theory of Computing Systems · doi:10.1007/s00224-020-10013-w · Cited by 23
Tan, Y., & Rosdi, B. A. (2014) · Neurocomputing · doi:10.1016/j.neucom.2014.06.001 · Cited by 23
Universal Multiparty Data Exchange and Secret Key Agreement
Tyagi, H., & Watanabe, S. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2694850 · Cited by 23
The Prediction of Merged Attributes with Multiple Viewpoint Systems
Hedges, T., & Wiggins, G. A. (2016) · Journal of New Music Research · doi:10.1080/09298215.2016.1205632 · Cited by 23
Compression with the tudocomp Framework
Dinklage, P., Fischer, J., Köppl, D., Löbel, M., & Sadakane, K. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2017.13 · Cited by 23
Optimal in-place suffix sorting
Li, Z., Li, J., & Huo, H. (2021) · Information and Computation · doi:10.1016/j.ic.2021.104818 · Cited by 23
Compression and classification methods for hyperspectral images
Kaarna, A., Toivanen, P., & Keränen, P. (2006) · Pattern Recognition and Image Analysis · doi:10.1134/s1054661806030114 · Cited by 23
Finger Search in Grammar-Compressed Strings
Bille, P., Christiansen, A. R., Cording, P. H., & Gørtz, I. L. (2018) · Theory of Computing Systems · doi:10.1007/s00224-017-9839-9 · Cited by 23
Conditional Lempel-Ziv complexity and its application to source coding theorem with side information
Uyematsu, T., & Kuzuoka, S. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2003.1228156 · Cited by 23
Yokoo, H. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.108251 · Cited by 23
Serial turbo coding for data compression and the Slepian-Wolf problem
Deslauriers, I., & Bajcsy, J. (2004) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2003.1216752 · Cited by 23
Distance Measures for SequencesPreprint
Hosangadi, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.5713 · Cited by 23
Titchy: Online Time-Series Compression With Random Access for the Internet of Things
Vestergaard, R., Zhang, Q., Sipos, M., & Lucani, D. E. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3081868 · Cited by 22
Moser, J., Bensaid, S., Kroupi, E., Schleger, F., Wendling, F., Ruffini, G., & Preissl, H. T. (2019) · Frontiers in Systems Neuroscience · doi:10.3389/fnsys.2019.00023 · Cited by 22
(2011) · Springer eBooks · doi:10.1007/springerreference_57848 · Cited by 22
Contrasting stochasticity with chaos in a permutation Lempel–Ziv complexity — Shannon entropy plane
Mateos, D. M., Zozor, S., & Olivares, F. (2020) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124640 · Cited by 22
Ketamine and sleep modulate neural complexity dynamics in cats
Pascovich, C., Castro‐Zaballa, S., Mediano, P. A. M., Bor, D., Canales‐Johnson, A., Torterolo, P., & Bekinschtein, T. A. (2022) · European Journal of Neuroscience · doi:10.1111/ejn.15646 · Cited by 22
Textual data compression in computational biology: Algorithmic techniques
Giancarlo, R., Scaturro, D., & Utro, F. (2012) · Computer Science Review · doi:10.1016/j.cosrev.2011.11.001 · Cited by 22
Reducing communication overhead in distributed learning by an order of magnitude (almost)
Øland, A., & Raj, B. (2015) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2015.7178365 · Cited by 22
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
Louchard, G., Szpankowski, W., & Tang, J. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539796301811 · Cited by 22
Compressing table data with column dependency
Vo, B. D., & Vo, K.-P. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.07.016 · Cited by 22
Phase transitions in tumor growth VI: Epithelial–Mesenchymal transition
Guerra, A., Rodríguez, D., Montero, S., Betancourt-Mar, J. A., Martin, R. R., Silva, E., Bizzarri, M., Cocho, G., Mansilla, R., & Nieto-Villar, J. M. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.01.040 · Cited by 22
Similarity in languages and programs
Cui, C., Dang, Z., Fischer, T. R., & Ibarra, Ó. H. (2013) · Theoretical Computer Science · doi:10.1016/j.tcs.2013.05.040 · Cited by 22
Some properties of sequential predictors for binary Markov sources
Merhav, N., Feder, M., & Gutman, M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256496 · Cited by 22
Distributed Database Design for Mobile Geographical Applications
Choy, M., Kwan, M., & Leong, H. V. (2000) · Journal of Database Management · doi:10.4018/jdm.2000010101 · Cited by 22
Design and Development of Bioinformatics Feature Based DNA Sequence Data Compression Algorithm
Banerjee, K., & Bali, V. (2019) · EAI Endorsed Transactions on Pervasive Health and Technology · doi:10.4108/eai.13-7-2018.164097 · Cited by 22
Optimal compressed representation of high throughput sequence data via light assembly
Ginart, A. A., Hui, J., Zhu, K., Numanagić, I., Courtade, T. A., Şahinalp, S. C., & Tse, D. N. C. (2018) · Nature Communications · doi:10.1038/s41467-017-02480-6 · Cited by 22
Singh, G., & Singh, A. K. (2020) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2020.102201 · Cited by 22
Deep Reinforcement Learning for Efficient IoT Data Compression in Smart Railroad Management
Chen, X., Yu, Q., Dai, S., Sun, P., Tang, H., & Cheng, L. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3348487 · Cited by 22
Application of Learning Automata to Image Data Compression
Hashim, A. A., Amir, S. F., & Mars, P. (1986) · Springer eBooks · doi:10.1007/978-1-4757-1895-9_15 · Cited by 22
Swap compression: resurrecting old ideas
Cortés, T., Becerra, Y., & Cervera, R. (2000) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(20000425)30:5<567::aid-spe312>3.0.co;2-z · Cited by 22
A general-purpose compression scheme for large collections
Cannane, A., & Williams, H. E. (2002) · ACM Transactions on Information Systems · doi:10.1145/568727.568730 · Cited by 22
On Universal Compression with Constant Random Access
Tatwawadi, K., Bidokhti, S. S., & Weissman, T. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437931 · Cited by 22
Image Classification Via LZ78 Based String Kernel: A Comparative Study
Li, M., & Yanong Zhu, A. (2006) · Lecture notes in computer science · doi:10.1007/11731139_81 · Cited by 22
Pizzolante, R., & Carpentieri, B. (2013) · IEEE International Conference on Digital Signal Processing (DSP) · doi:10.1109/icdsp.2013.6622763 · Cited by 22
Context-based coding of bilevel images enhanced by digital straight line analysis
Aghito, S. M., & Forchhammer, S. O. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.875168 · Cited by 22
Yang, E., & Zhang, Z. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782108 · Cited by 22
Crypto-Compression System for Secure Tranfer of Medical Images
Borie, J.-C., Puech, W., & Dumas, M. (2004) · HAL · Cited by 22
Unified VLSI systolic array design for LZ data compression
Hwang, S.-A., & Wu, C. (2001) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.931226 · Cited by 22
Displaying radiologic images on personal computers: Image storage and compression—Part 2
Gillespy, T., & Rowberg, A. H. (1994) · Journal of Imaging Informatics in Medicine · doi:10.1007/bf03168473 · Cited by 22
High-resolution digital teleradiology: A perspective
Kuduvalli, G., Rangayyan, R. M., & Desautels, J. E. L. (1991) · Journal of Imaging Informatics in Medicine · doi:10.1007/bf03173908 · Cited by 22
Does Writing with Language Models Reduce Content Diversity?
Padmakumar, V., & He, H. (2023) · arXiv · doi:10.48550/arxiv.2309.05196 · Cited by 21
Pattern Matching in Compressed Texts and Images
Adjeroh, D., Bell, T., & Mukherjee, A. (2013) · now publishers, Inc. eBooks · doi:10.1561/2000000038 · Cited by 21
Inference and minimization of hidden Markov chains
Gillman, D. W., & Sipser, M. (1994) · Conference on Learning Theory · doi:10.1145/180139.181091 · Cited by 21
High-MCC Functions in the Linux Kernel
Jbara, A., Matan, A., & Feitelson, D. G. (2013) · Empirical Software Engineering · doi:10.1007/s10664-013-9275-7 · Cited by 21
Effects of religious and spiritual variables on outcomes in violent relationships
Katerndahl, D. A., Burge, S. K., Ferrer, R. L., Becho, J., & Wood, R. G. (2015) · The International Journal of Psychiatry in Medicine · doi:10.1177/0091217415589297 · Cited by 21
Branch prediction based on universal data compression algorithms
Federovsky, E., Feder, M., & Weiss, S. (2002) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.1998.694763 · Cited by 21
Predicting the Lossless Compression Ratio of Remote Sensing Images With Configurational Entropy
Cheng, X., & Li, Z. (2021) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2021.3123650 · Cited by 21
A technique for high ratio LZW compression [logic test vector compression]
Knieser, M. J., Wolff, F., Papachristou, C., Weyer, D., & McIntyre, D. R. (2003) · Design, Automation, and Test in Europe · doi:10.1109/date.2003.1253596 · Cited by 21
Packer identification method based on byte sequences
Jung, B., Bae, S. I., Choi, C., & Im, E. G. (2018) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.5082 · Cited by 21
Context Prediction in Pervasive Computing Systems: Achievements and Challenges
Boytsov, A., & Zaslavsky, A. (2010) · Annals of information systems · doi:10.1007/978-1-4419-7406-8_3 · Cited by 21
Exalt: empowering researchers to evaluate large-scale storage systems
Wang, Y., Kapritsos, M., Schmidt, L., Alvisi, L., & Dahlin, M. (2014) · Networked Systems Design and Implementation · doi:10.5555/2616448.2616461 · Cited by 21
High-Performance Operations Using a Compressed Database Architecture
Cockshott, W. P. (1998) · The Computer Journal · doi:10.1093/comjnl/41.5.283 · Cited by 21
FCTrees: A Front-Coded Family of Compressed Tree-Based FIB Structures for NDN Routers
Karrakchou, O., Samaan, N., & Karmouch, A. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.2969172 · Cited by 21
An Efficient Implementation of LZW Decompression in the FPGA
Zhou, X., Ito, Y., & Nakano, K. (2016) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw.2016.33 · Cited by 21
Universal fixed-to-variable source coding in the finite blocklength regime
Kosut, O., & Sankar, L. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620306 · Cited by 21
Dynamical analysis reveals individuality of locomotion in goldfish
Neumeister, H., Cellucci, C. J., Rapp, P. E., Korn, H., & Faber, D. S. (2004) · Journal of Experimental Biology · doi:10.1242/jeb.00811 · Cited by 21
Note on the greedy parsing optimality for dictionary-based text compression
Crochemore, M., Langiu, A., & Mignosi, F. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.01.013 · Cited by 21
Dutta, A., Levi, R., Ron, D., & Rubinfeld, R. (2013) · DCC · doi:10.1109/dcc.2013.19 · Cited by 21
Lin, M.-B. (2000) · The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology · doi:10.1023/a:1026559601791 · Cited by 21
An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle
Lefebvre, A., Lecroq, T., & Alexandre, J. (2003) · Journal of automata, languages and combinatorics · doi:10.25596/jalc-2003-647 · Cited by 21
Ziv, J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016069 · Cited by 21
Self-citationOn the Ziv-Lempel proof and related topics
Sheinwald, D. (1994) · Proceedings of the IEEE · doi:10.1109/5.286190 · Cited by 21
Using structural contexts to compress semistructured text collections
Adiego, J., Navarro, G., & de la Fuente, P. (2006) · Information Processing & Management · doi:10.1016/j.ipm.2006.07.001 · Cited by 21
Data compression with long repeated strings
Bentley, J. L., & McIlroy, D. (2001) · Information Sciences · doi:10.1016/s0020-0255(01)00097-4 · Cited by 21
On the optimality of parsing in dynamic dictionary based data compression
Matias, Y. (1999) · Cited by 21
The microarchitecture of the IBM eServer z900 processor
Schwarz, E. M., Check, M. A., Shum, C., Koehler, T., Swaney, S., MacDougall, J. D., & Krygowski, C. A. (2002) · IBM Journal of Research and Development · doi:10.1147/rd.464.0381 · Cited by 21
Complexity reduction of the context-tree weighting algorithm : a study for KPN Research
Willems, F. F., & Tjalkens, T. J. (1997) · TU/e Research Portal · Cited by 21
Algorithms for Compressed Inputs
Brunelle, N., Robins, G., & Shelat, A. A. (2013) · DCC · doi:10.1109/dcc.2013.60 · Cited by 21
AIT Foundations of Structured Experience
Ruffini, G., & Lopez-Sola, E. (2022) · Journal of Artificial Intelligence and Consciousness · doi:10.1142/s2705078522500047 · Cited by 20
Livada, Č., Horvat, T., & Baumgartner, A. (2023) · Applied Sciences · doi:10.3390/app13053152 · Cited by 20
Correlation Lengths in the Language of Computable Information
Martiniani, S., Lemberg, Y., Chaikin, P. M., & Levine, D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.170601 · Cited by 20
Stationary and Transition Probabilities in Slow Mixing, Long Memory Markov Processes
Asadi, M., Torghabeh, R. P., & Santhanam, N. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2334594 · Cited by 20
Data-Aware Adaptive Compression for Stream Processing
Zhang, Y., Zhang, F., Li, H., Zhang, S., Guo, X., Chen, Y., Pan, A., & Du, X. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3377710 · Cited by 20
Causality–Complexity–Consistency: Can Space-Time Be Based on Logic and Computation?
Baumeler, Ä., & Wolf, S. (2017) · Tutorials, schools, and workshops in the mathematical sciences · doi:10.1007/978-3-319-68655-4_6 · Cited by 20
Ladderpath Approach: How Tinkering and Reuse Increase Complexity and Information
Liu, Y., Di, Z., & Gerlee, P. (2022) · Entropy · doi:10.3390/e24081082 · Cited by 20
Information Parity: Measuring and Predicting the Multilingual Capabilities of Language Models
Tsvetkov, A., & Kipnis, A. (2024) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2024.findings-emnlp.468 · Cited by 20
The relationship between greedy parsing and symbolwise text compression
Bell, T., & Witten, I. H. (1994) · Journal of the ACM · doi:10.1145/179812.179892 · Cited by 20
Long Video Diffusion Generation with Segmented Cross-Attention and Content-Rich Video Data Curation
Yan, X., Cai, Y., Wang, Q., Zhou, Y., Huang, W., & Yang, H. (2025) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52734.2025.00303 · Cited by 20
Fast universal coding with context models
Rissanen, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.761250 · Cited by 20
Lempel-Ziv (LZ77) Factorization in Sublinear Time
Kempa, D., & Kociumaka, T. (2024) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs61266.2024.00122 · Cited by 20
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.