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 301–400 of 1,003
Estimating alphanumeric selectivity in the presence of wildcards
Krishnan, P., Vitter, J. S., & Iyer, B. (1996) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/233269.233341 · Cited by 75
Prediction in wireless networks by Markov chains
Katsaros, D., & Manolopoulos, Y. (2009) · IEEE Wireless Communications · doi:10.1109/mwc.2009.4907561 · Cited by 74
Practical compressed string dictionaries
Martínez‐Prieto, M. A., Brisaboa, N. R., Cánovas, R., Claude, F., & Navarro, G. (2015) · Information Systems · doi:10.1016/j.is.2015.08.008 · Cited by 74
CPT+: Decreasing the Time/Space Complexity of the Compact Prediction Tree
Gueniche, T., Fournier‐Viger, P., Raman, R., & Tseng, V. S. M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-18032-8_49 · Cited by 74
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., & Hashimoto, K. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.12.016 · Cited by 74
Massively-Parallel Lossless Data Decompression
Sitaridi, E. A., Mueller, R., Kaldewey, T., Lohman, G. M., & Ross, K. A. (2016) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.2016.35 · Cited by 74
Rivals, É., Delgrange, O., Delahaye, J.-P., Dauchet, M., Delorme, M.-O., Hénaut, A., & Ollivier, E. (1997) · Computer applications in the biosciences · doi:10.1093/bioinformatics/13.2.131 · Cited by 74
Fixed-slope universal lossy data compression
Yang, E., Zhang, Z., & Berger, T. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.623145 · Cited by 74
Approximating the smallest grammar: Kolmogorov complexity in natural models
Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Rasala, A., Sahai, A., & Shelat, A. A. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.510021 · Cited by 74
FAST: Efficient Action Tokenization for Vision-Language-Action Models
Pertsch, K., Stachowicz, K., Ichter, B., Driess, D., Nair, S., Vuong, Q., Mees, O., Finn, C., & Levine, S. (2025) · arXiv · doi:10.48550/arxiv.2501.09747 · Cited by 73
Amjad, I., Toor, H., Niazi, I. K., Afzal, H., Jochumsen, M., Shafique, M., Allen, K., Haavik, H., & Ahmed, T. (2019) · International Journal of Neuroscience · doi:10.1080/00207454.2018.1551894 · Cited by 73
Compressing atmospheric data into its real information content
Klöwer, M., Razinger, M., Dominguez, J. J., Düben, P. D., & Palmer, T. N. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00156-2 · Cited by 73
Universal and Accessible Entropy Estimation Using a Compression Algorithm
Avinery, R., Kornreich, M., & Beck, R. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.178102 · Cited by 73
Interaction between Record Matching and Data Repairing
Fan, W., Ma, S., Tang, N., & Yu, W. (2014) · Journal of Data and Information Quality · doi:10.1145/2567657 · Cited by 73
Distortion-rate theory for individual sequences
Ziv, J. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056164 · Cited by 73
Self-citationLossless compression of synchronized phasor measurements
Klump, R. P., Agarwal, P. R., Tate, J. E., & Khurana, H. (2010) · IEEE Power Engineering Society General Meeting · doi:10.1109/pes.2010.5590156 · Cited by 72
Data compression using long common strings
Bentley, J. L., & McIlroy, D. L. (1999) · DCC · doi:10.1109/dcc.1999.755678 · Cited by 72
Application of Lempel–Ziv complexity to the analysis of neural discharges
Szczepański, J., Amigó, J. M., Wajnryb, E., & Sanchez-Vives, M. V. (2003) · Network Computation in Neural Systems · doi:10.1088/0954-898x_14_2_309 · Cited by 72
Enhancing security using mobility-based anomaly detection in cellular mobile networks
Sun, B., Yu, F. R., Wu, K., Xiao, Y., & Leung, V. C. M. (2006) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2006.874579 · Cited by 71
Jin, C., Pok, G., Lee, Y., Park, H., Kim, K. D., Yun, U., & Ryu, K. H. (2014) · Energy Conversion and Management · doi:10.1016/j.enconman.2014.11.010 · Cited by 70
Data Compression Device Based on Modified LZ4 Algorithm
Liu, W., Mei, F., Wang, C., O'Neill, M. P., & Swartzlander, E. E. (2018) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2018.2810480 · Cited by 70
Mobility-based anomaly detection in cellular mobile networks
Sun, B., Yu, F. R., Wu, K., & Leung, V. C. M. (2004) · Workshop on Wireless Security · doi:10.1145/1023646.1023658 · Cited by 70
A Review of Smart House Analysis Methods for Assisting Older People Living Alone
Sánchez, V. G., Pfeiffer, C., & Skeie, N. (2017) · Journal of Sensor and Actuator Networks · doi:10.3390/jsan6030011 · Cited by 69
Information Entropy As a Basic Building Block of Complexity Theory
Gao, J., Liu, F., Zhang, J., Hu, J., & Cao, Y. (2013) · Entropy · doi:10.3390/e15093396 · Cited by 69
Bell, T. (1986) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1986.1096485 · Cited by 69
On the Complexity of Traffic Traces and Implications
Avin, C., Ghobadi, M., Griner, C., & Schmid, S. (2020) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/3393691.3394205 · Cited by 68
Weakly convergent nonparametric forecasting of stationary time series
Morvai, G., Yakowitz, S., & Algoet, P. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.556107 · Cited by 68
Engineering the compression of massive tables: an experimental approach
Buchsbaum, A. L., Caldwell, D., Church, K., Fowler, G. S., & Muthukrishnan, S. (2000) · Symposium on Discrete Algorithms · doi:10.5555/338219.338249 · Cited by 68
Generalized Tunstall codes for sources with memory
Savari, S. A., & Gallager, R. G. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.556121 · Cited by 68
On the minimum description length principle for sources with piecewise constant parameters
Merhav, N. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.265504 · Cited by 68
Boyer—Moore String Matching over Ziv-Lempel Compressed Text
Navarro, G., & Tarhio, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45123-4_16 · Cited by 68
Limits to consistent on-line forecasting for ergodic time series
Györfi, L., Morvai, G., & Yakowitz, S. J. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661540 · Cited by 68
Gambling using a finite state machine
Feder, M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.133269 · Cited by 67
Optimal prefetching via data compression
Vitter, J. S., & Krishnan, P. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1991.185360 · Cited by 67
Timestamped whole program path representation and its applications
Zhang, Y., & Gupta, R. (2001) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/378795.378835 · Cited by 67
Compression of multispectral images by spectral classification and transform coding
Gelli, G., & Poggi, G. (1999) · IEEE Transactions on Image Processing · doi:10.1109/83.753736 · Cited by 66
A combinatorial view on string attractors
Mantaci, S., Restivo, A., Romana, G., Rosone, G., & Sciortino, M. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.11.006 · Cited by 66
Universal coding with minimum probability of codeword length overflow
Merhav, N. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.79912 · Cited by 66
Adaptive online data compression
Jeannot, E., Knutsson, B., & Björkman, M. (2002) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1109/hpdc.2002.1029938 · Cited by 66
Human Activity Prediction in Smart Home Environments with LSTM Neural Networks
Tax, N. (2018) · International Conference on Intelligent Environments (IE) · doi:10.1109/ie.2018.00014 · Cited by 65
A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices
Crochemore, M., Landau, G. M., & Ziv-Ukelson, M. (2002) · HAL · Cited by 65
Fixed data base version of the Lempel-Ziv data compression algorithm
Wyner, A. D., & Ziv, J. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.79955 · Cited by 65
Self-citationStructures of String Matching and Data Compression
Larsson, N. (1999) · Lund University Publications (Lund University) · Cited by 65
Toward a Theory of Tokenization in LLMsPreprint
Rajaraman, N., Jiao, J., & Ramchandran, K. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2404.08335 · Cited by 64
Dependable computing and online testing in adaptive and configurable systems
Saxena, N. R., Fernandez-Gomez, S., Huang, W.-J., Mitra, S., Yu, S.-Y., & McCluskey, E. J. (2000) · IEEE Design & Test of Computers · doi:10.1109/54.825675 · Cited by 64
Wenzel, M., Han, S., Smith, E. H., Hoel, E., Greger, B., House, P. A., & Yuste, R. (2019) · Cell Systems · doi:10.1016/j.cels.2019.03.007 · Cited by 63
An algorithmic information theory of consciousness
Ruffini, G. (2017) · Neuroscience of Consciousness · doi:10.1093/nc/nix019 · Cited by 63
Complex systems approach to natural language
Stanisz, T., Drożdż, S., & Kwapień, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.12.002 · Cited by 63
Estimating the Entropy Rate of Finite Markov Chains With Application to Behavior Studies
Vegetabile, B., Stout, S. A., Davis, E. P., Baram, T. Z., & Stern, H. P. (2019) · Journal of Educational and Behavioral Statistics · doi:10.3102/1076998618822540 · Cited by 63
On sequential strategies for loss functions with memory
Merhav, N., Ordentlich, E., Seroussi, G., & Weinberger, M. J. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013135 · Cited by 63
Online Learning of Non-stationary Sequences
Monteleoni, C., & Jaakkola, T. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 63
Migratory compression: coarse-grained data reordering to improve compressibility
Lin, X., Lu, G., Douglis, F., Shilane, P., & Wallace, G. (2014) · File and Storage Technologies · doi:10.5555/2591305.2591330 · Cited by 63
Hidden Markov Processes: Theory and Applications to Biology
Vidyasagar, M. (2014) · Princeton University Press eBooks · doi:10.23943/princeton/9780691133157.001.0001 · Cited by 63
A Lossless Data Compression and Decompression Algorithm and Its Hardware Architecture
Lin, M.-B., Lee, J.-F., & Jan, G. E. (2006) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2006.884045 · Cited by 63
Towards Behaviometric Security Systems: Learning to Identify a Typist
Nisenson, M., Yariv, I., El‐Yaniv, R., & Meir, R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39804-2_33 · Cited by 62
PPM-Decay: A computational model of auditory prediction with memory decay
Harrison, P. M. C., Bianco, R., Chait, M., & Pearce, M. T. (2020) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1008304 · Cited by 62
Henkel, J., & Parameswaran, S. (2007) · Springer eBooks · doi:10.1007/978-1-4020-5869-1 · Cited by 62
Universal decoding for memoryless Gaussian channels with a deterministic interference
Merhav, N. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243443 · Cited by 62
Alaghbari, K. A., Md. Saad, M. H., Hussain, A., & Alam, M. R. (2022) · IEEE Access · doi:10.1109/access.2022.3157726 · Cited by 61
“We compared the performance of the LSTM algorithm with two popular sequence prediction algorithms such as ALZ [27] and LZ78 [28][16].”
MethodResultInfluentialAverage profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
Louchard, G., & Szpankowski, W. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.370149 · Cited by 61
An Introduction to Universal Artificial Intelligence
Hütter, M., Quarel, D., & Catt, E. (2024) · Chapman & Hall/CRC eBooks · doi:10.1201/9781003460299 · Cited by 61
Sublinear Algorithms for Approximating String Compressibility
Raskhodnikova, S., Ron, D., Rubinfeld, R., & Smith, A. (2012) · Algorithmica · doi:10.1007/s00453-012-9618-6 · Cited by 61
COMPRESS: A Comprehensive Framework of Trajectory Compression in Road Networks
Han, Y., Sun, W., & Zheng, B. (2017) · ACM Transactions on Database Systems · doi:10.1145/3015457 · Cited by 61
A competitive Neyman-Pearson approach to universal hypothesis testing with applications
Levitan, E., & Merhav, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.800478 · Cited by 61
Truncated suffix trees and their application to data compression
Na, J. C., Apostolico, A., Iliopoulos, C. S., & Park, K. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(03)00053-7 · Cited by 61
Estimating the number of states of a finite-state source
Ziv, J., & Merhav, N. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.108249 · Cited by 61
Self-citationA reliable LZ data compressor on reconfigurable coprocessors
Huang, W.-J., Saxena, N. R., & McCluskey, E. J. (2002) · IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM) · doi:10.1109/fpga.2000.903412 · Cited by 61
Fundamentals of Cryptology: A Professional Reference and Interactive Tutorial
van Tilborg, H. C. A. (1999) · Cited by 60
Malware Classification and Class Imbalance via Stochastic Hashed LZJD
Raff, E., & Nicholas, C. (2017) · ACM Workshop on Artificial Intelligence and Security (AISec) · doi:10.1145/3128572.3140446 · Cited by 60
Krijnen, T., & Beetz, J. (2017) · Advanced Engineering Informatics · doi:10.1016/j.aei.2017.03.008 · Cited by 60
Zhang, Z., & Wei, V. K. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.490546 · Cited by 60
Fast searching on compressed text allowing errors
de Moura, E. S., Navarro, G., Ziviani, N., & Baeza-Yates, R. A. (1998) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/290941.291013 · Cited by 60
Fazio, P., Rango, F. D., & Tropea, M. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2684778 · Cited by 59
The Unsupervised Acquisition of a Lexicon from Continuous SpeechPreprint
de Marcken, C. (1995) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9512002 · Cited by 59
Zhang, Y., & Li, J. (2006) · Journal of Computing in Civil Engineering · doi:10.1061/(asce)0887-3801(2006)20:6(390 · Cited by 59
Testing time symmetry in time series using data compression dictionaries
Kennel, M. B. (2004) · Physical Review E · doi:10.1103/physreve.69.056208 · Cited by 59
On Lempel–Ziv complexity for multidimensional data analysis
Zozor, S., Ravier, P., & Buttelli, O. (2004) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(04)00994-x · Cited by 59
Cache-based compaction: a new technique for optimizing Web transfer
Chan, M. C., & Woo, T. Y. C. (1999) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1999.749259 · Cited by 59
A compression technique for large statistical data-bases
Eggers, S. J., Olken, F., & Shoshani, A. (1981) · eScholarship (California Digital Library) · Cited by 59
Cysouw, M. (2011) · Mouton eBooks · doi:10.1515/9783110219098.411 · Cited by 58
Huang, S., & Jou, M.-J. (2004) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2004.825899 · Cited by 58
Ligra: A Lightweight Graph Processing Framework for Shared Memory
Shun, J. (2017) · doi:10.1145/3018787.3018795 · Cited by 58
Distance measures for biological sequences: Some recent approaches
Mantaci, S., Restivo, A., & Sciortino, M. (2007) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2007.03.011 · Cited by 58
Universal data compression based on the Burrows-Wheeler transformation: theory and practice
Kurtz, S., & Balkenhol, B. (2000) · IEEE Transactions on Computers · doi:10.1109/12.888040 · Cited by 58
Stronger Lempel-Ziv Based Compressed Text Indexing
Arroyuelo, D., Navarro, G., & Sadakane, K. (2010) · Algorithmica · doi:10.1007/s00453-010-9443-8 · Cited by 58
Crochemore, M., Ilie, L., Iliopoulos, C. S., Kubica, M., Rytter, W., & Waleń, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10217-2_18 · Cited by 58
Image compression by texture modeling in the wavelet domain
Ryan, T. W., Sanders, L., Fisher, H. D., & Iverson, A. E. (1996) · IEEE Transactions on Image Processing · doi:10.1109/83.481668 · Cited by 57
The interactions between ergodic theory and information theory
Shields, P. C. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720532 · Cited by 57
A class of distortionless codes designed by Bayes decision theory
MATSUSHIMA, T. K., Inazumi, H., & Hirasawa, S. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.133247 · Cited by 57
An empirical study of delta algorithms
Hunt, J. J., Vo, K.-P., & Tichy, W. F. (1996) · Lecture notes in computer science · doi:10.1007/bfb0023080 · Cited by 57
Guessing the Composer's Mind: Applying Universal Prediction to Musical Style
Assayag, G., Dubnov, S., & Delerue, O. (1999) · International Computer Music Conference · Cited by 57
Universal Randomized Guessing With Application to Asynchronous Decentralized Brute–Force Attacks
Merhav, N., & Cohen, A. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849716 · Cited by 56
Gutiérrez‐Tobal, G. C., Hornero, R., Álvarez, D., Marcos, J. V., & del Campo, F. (2012) · Physiological Measurement · doi:10.1088/0967-3334/33/7/1261 · Cited by 56
Variable rate vector quantization for speech, image, and video compression
Lookabaugh, T. D., Riskin, E. A., Chou, P. A., & Gray, R. M. (1993) · IEEE Transactions on Communications · doi:10.1109/26.212378 · Cited by 56
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
Verbin, E., & Yu, W. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38905-4_24 · Cited by 56
Dictionary Based Secure Provenance Compression for Wireless Sensor Networks
Wang, C., Hussain, S. R., & Bertino, E. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2402156 · Cited by 56
Relative Lempel-Ziv factorization for efficient storage and retrieval of web collections
Hoobin, C., Puglisi, S. J., & Zobel, J. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2078331.2078341 · Cited by 56
Exponentiating Faster with Addition Chains
Yacobi, Y. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_20 · Cited by 56
A fast hardware data compression algorithm and some algorithmic extensions
Craft, D. J. (1998) · IBM Journal of Research and Development · doi:10.1147/rd.426.0733 · Cited by 55
Creativity and Universality in Language
Esposti, M. D., Altmann, E. G., & Pachet, F. (2016) · Lecture notes in morphogenesis · doi:10.1007/978-3-319-24403-7 · Cited by 55
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.