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 401–500 of 1,003
Data sources and approaches for building occupancy profiles at the urban scale – A review
Nejadshamsi, S., Eicker, U., Wang, C., & Bentahar, J. (2023) · Building and Environment · doi:10.1016/j.buildenv.2023.110375 · Cited by 55
Improving table compression with combinatorial optimization
Buchsbaum, A. L., Fowler, G. S., & Giancarlo, R. (2003) · Journal of the ACM · doi:10.1145/950620.950622 · Cited by 55
A Fast and Compact Web Graph Representation
Claude, F., & Navarro, G. (2007) · Springer eBooks · doi:10.1007/978-3-540-75530-2_11 · Cited by 55
Wu, X., Wan, X., Wu, G., Xu, D. H., & Lin, G. (2006) · International Journal of Bioinformatics Research and Applications · doi:10.1504/ijbra.2006.010602 · Cited by 55
Optimal Rule Caching and Lossy Compression for Longest Prefix Matching
Rottenstreich, O., & Tapolcai, J. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2016.2611482 · Cited by 55
Lossless compression of medical images using Hilbert space-filling curves
Liang, J.-Y., Chen, C., Huang, C.-H., & Liu, L. (2008) · Computerized Medical Imaging and Graphics · doi:10.1016/j.compmedimag.2007.11.002 · Cited by 55
DNA sequence compression using the Burrows-Wheeler Transform
Adjeroh, D., Zhang, Y., Mukherjee, A., Powell, M., & Bell, T. (2003) · IEEE Computer Society Bioinformatics Conference (CSB) · doi:10.1109/csb.2002.1039352 · Cited by 55
COMPACT: a hybrid method for compressing test data
Ishida, M., Ha, D. S., & YAMAGUCHI, T. J. (2002) · IEEE VLSI Test Symposium (VTS) · doi:10.1109/vtest.1998.670850 · Cited by 55
Continuous Verification Using Keystroke Dynamics
Shimshon, T., Moskovitch, R., Rokach, L., & Elovici, Y. (2010) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/cis.2010.95 · Cited by 54
Twitter Content-Based Spam Filtering
Santos, I., Miñambres-Marcos, I., Laorden, C., Galán-García, P., Santamaría-Ibirika, A., & Bringas, P. G. (2013) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-01854-6_46 · Cited by 54
Efficient end to end data exchange using configurable compression
Wiseman, Y., Schwan, K., & Widener, P. M. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1075395.1075396 · Cited by 54
The piecewise-constant image model
Ausbeck, P. J. (2000) · Proceedings of the IEEE · doi:10.1109/5.892713 · Cited by 54
Arnavut, Z. (2007) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2006.888820 · Cited by 54
On the universality of the LZ-based decoding algorithm
Lapidoth, A., & Ziv, J. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705554 · Cited by 54
Self-citationMultidimensional signal compression using multiscale recurrent patterns
Carvalho, M. B. D., da Silva, E. A. B., & Finamore, W. A. (2002) · Signal Processing · doi:10.1016/s0165-1684(02)00302-x · Cited by 54
Nozawa, T., Konda, M., Fujibayashi, M., Imai, M., Kotani, K., Sugawa, S., & Ohmi, T. (2000) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.881222 · Cited by 54
On Bijective Variants of the Burrows-Wheeler TransformPreprint
Kufleitner, M. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0239 · Cited by 54
30th Annual Symposium on Combinatorial Pattern Matching
Pisanti, N., & Solon, P. P. (2019) · CINECA IRIS Institutial research information system (University of Pisa) · Cited by 54
Differential effects of propofol and ketamine on critical brain dynamics
Varley, T. F., Sporns, O., Puce, A., & Beggs, J. (2020) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1008418 · Cited by 53
Mind Your Inflections! Improving NLP for Non-Standard Englishes with Base-Inflection Encoding
Tan, S., Joty, S., Varshney, L. R., & Kan, M. (2020) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.455 · Cited by 53
Zender, C. S. (2016) · Geoscientific model development · doi:10.5194/gmd-9-3199-2016 · Cited by 53
Causal coding of stationary sources and individual sequences with high resolution
Linder, T., & Zamir, R. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862075 · Cited by 53
There is no universal source code for an infinite source alphabet
Györfi, L., Pali, I., & van der Meulen, E. C. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.272495 · Cited by 53
A practitioner's guide to data base compression tutorial
Severance, D. G. (1983) · Information Systems · doi:10.1016/0306-4379(83)90030-3 · Cited by 52
Moving Objects Analytics: Survey on Future Location & Trajectory Prediction MethodsPreprint
Georgiou, H., Καραγιώργου, Σ., Kontoulis, Y., Pelekis, N., Petrou, P. C., Scarlatti, D., & Theodoridis, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.04639 · Cited by 52
Das, S. K., Roy, N., & Roy, A. (2006) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2006.08.003 · Cited by 52
Indexing Highly Repetitive Collections
Navarro, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35926-2_29 · Cited by 52
The Centroid method for compressing sets of similar images
Karadimitriou, K., & Tyler, J. M. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(98)00033-6 · Cited by 52
Generalized Deduplication: Bounds, Convergence, and Asymptotic Properties
Vestergaard, R., Zhang, Q., & Lucani, D. E. (2019) · Globecom · doi:10.1109/globecom38437.2019.9014012 · Cited by 52
Augmenting Suffix Trees, with Applications
Matias, Y., Muthukrishnan, S., Şahinalp, S. C., & Ziv, J. (1998) · Lecture notes in computer science · doi:10.1007/3-540-68530-8_6 · Cited by 52
Self-citationTo Zip or not to Zip: effective resource usage for real-time compression
Harnik, D., Kat, R. I., Margalit, O., Sotnikov, D. V., & Traeger, A. (2013) · File and Storage Technologies · doi:10.5555/2591272.2591296 · Cited by 52
Bookstein, A., & Klein, S. T. (1993) · Computing · doi:10.1007/bf02243872 · Cited by 52
Jorna, R., Faber, N. R., & Hadders, H. (2011) · Cited by 51
Pattern recognition in airflow recordings to assist in the sleep apnoea–hypopnoea syndrome diagnosis
Gutiérrez‐Tobal, G. C., Álvarez, D., Marcos, J. V., del Campo, F., & Hornero, R. (2013) · Medical & Biological Engineering & Computing · doi:10.1007/s11517-013-1109-7 · Cited by 51
Examining the Limits of Predictability of Human Mobility
Kulkarni, V., Mahalunkar, A., Garbinato, B., & Kelleher, J. D. (2019) · Entropy · doi:10.3390/e21040432 · Cited by 51
Universal linear least squares prediction: upper and lower bounds
Singer, A. C., Kozat, S. S., & Feder, M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.800489 · Cited by 51
On the Approximation Ratio of Ordered Parsings
Navarro, G., Ochoa, C., & Prezza, N. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3042746 · Cited by 51
On the privacy afforded by adaptive text compression
Witten, I. H., & Cleary, J. G. (1988) · Computers & Security · doi:10.1016/0167-4048(88)90580-9 · Cited by 51
Reducing the Space Requirement of LZ-Index
Arroyuelo, D., Navarro, G., & Sadakane, K. (2006) · Lecture notes in computer science · doi:10.1007/11780441_29 · Cited by 51
Self-indexed Text Compression Using Straight-Line Programs
Claude, F., & Navarro, G. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03816-7_21 · Cited by 51
Universal data compression and repetition times
Willems, F. M. J. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.42176 · Cited by 51
Natural type selection in adaptive lossy compression
Zamir, R., & Rose, K. H. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.904515 · Cited by 51
Practical Parallel Lempel-Ziv Factorization
Shun, J., & Zhao, F. (2013) · DCC · doi:10.1109/dcc.2013.20 · Cited by 51
Carpi, A., & de Luca, A. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00334-5 · Cited by 51
Practical dictionary management for hardware data compression
Bunton, S., & Borriello, G. (1992) · Communications of the ACM · doi:10.1145/129617.129622 · Cited by 51
Adapting wavelet compression to human motion capture clips
Beaudoin, P., Poulin, P., & van de Panne, M. (2007) · Proceedings · doi:10.1145/1268517.1268568 · Cited by 51
On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)
Borodin, A., El‐Yaniv, R., & Gogan, V. (2000) · Lecture notes in computer science · doi:10.1007/10719839_19 · Cited by 50
Complexity Measures for EEG Microstate Sequences: Concepts and Algorithms
von Wegner, F., Wiemers, M., Hermann, G., Tödt, I., Tagliazucchi, E., & Laufs, H. (2023) · Brain Topography · doi:10.1007/s10548-023-01006-2 · Cited by 50
Data compression and learning in time sequences analysis
Puglisi, A., Benedetto, D., Caglioti, E., Loreto, V., & Vulpiani, A. (2003) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(03)00047-2 · Cited by 50
The Odyssey of Entropy: Cryptography
Zolfaghari, B., Bibak, K., & Koshiba, T. (2022) · Entropy · doi:10.3390/e24020266 · Cited by 50
An Efficient Horizontal and Vertical Method for Online DNA Sequence Compression
Mishra, K. N., Aaggarwal, A., Abdelhadi, E., & Srivastava, P. C. (2010) · International Journal of Computer Applications · doi:10.5120/757-954 · Cited by 50
On the Complexity of Traffic Traces and Implications
Avin, C., Ghobadi, M., Griner, C., & Schmid, S. (2020) · Proceedings of the ACM on Measurement and Analysis of Computing Systems · doi:10.1145/3379486 · Cited by 50
Universal Switching Linear Least Squares Prediction
Kozat, S. S., & Singer, A. C. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.901161 · Cited by 50
P-complete problems in data compression
Agostino, S. D. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90106-6 · Cited by 50
Entropy rates and finite-state dimension
Bourke, C., Hitchcock, J. M., & Vinodchandran, N. V. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.040 · Cited by 50
Efficient end to end data exchange using configurable compression
Wiseman, Y., Schwan, K., & Widener, P. M. (2004) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2004.1281587 · Cited by 50
Analog-to-Digital Compression: A New Paradigm for Converting Signals to Bits
Kipnis, A., Eldar, Y. C., & Goldsmith, A. J. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2774249 · Cited by 49
Approximate String Matching with Compressed Indexes
S.Russo, L. M., Navarro, G., Oliveira, A. L., & Morales, P. (2009) · Algorithms · doi:10.3390/a2031105 · Cited by 49
Data Compression Concepts and Algorithms and Their Applications to Bioinformatics
Nalbantoğlu, Ö. U., Russell, D. J., & Sayood, K. (2009) · Entropy · doi:10.3390/e12010034 · Cited by 49
Fast Distance Multiplication of Unit-Monge Matrices
Tiskin, A. (2013) · Algorithmica · doi:10.1007/s00453-013-9830-z · Cited by 49
Soft Decision Quantization for H.264 With Main Profile Compatibility
Yang, E., & Yu, X. Y. (2008) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2008.2009260 · Cited by 49
ESP-index: A compressed index based on edit-sensitive parsing
Maruyama, S., Nakahara, M., Kishiue, N., & Sakamoto, H. (2012) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2012.07.009 · Cited by 48
Universal Reinforcement Learning
Farias, V. F., Moallemi, C. C., Roy, B. V., & Weissman, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043762 · Cited by 48
Entropy of English text: Experiments with humans and a machine learning system based on rough sets
Moradi, H., Grzymala‐Busse, J. W., & Roberts, J. A. (1998) · Information Sciences · doi:10.1016/s0020-0255(97)00074-1 · Cited by 48
Sardashti, S., Seznec, A., & Wood, D. A. (2016) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2976740 · Cited by 48
On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences
Limniotis, K., Kolokotronis, N., & Kalouptsidis, N. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.907442 · Cited by 48
Dictionary-based order-preserving string compression
Antoshenkov, G. (1997) · The VLDB Journal · doi:10.1007/s007780050031 · Cited by 48
On-line and off-line heuristics for inferring hierarchies of repetitions in sequences
Nevill-Manning, C. G., & Witten, I. H. (2000) · Proceedings of the IEEE · doi:10.1109/5.892710 · Cited by 48
Ohm, J.-R., Grüneberg, K., Hendriks, E. A., Izquierdo, M. E., Kalivas, D. S., Karl, M., Papadimatos, D., & Redert, A. (1998) · Signal Processing Image Communication · doi:10.1016/s0923-5965(98)00034-4 · Cited by 48
An efficient method for compressing test data
YAMAGUCHI, T. J., Tilgner, M., Ishida, M., & Ha, D. S. (2002) · IEEE International Test Conference (ITC) · doi:10.1109/test.1997.639597 · Cited by 48
Music complexity: a multi-faceted description of audio content
Streich, S. (2007) · Repositori digital de la UPF (Universitat Pompeu Fabra) · Cited by 48
Grid-enabling medical image analysis
Germain‐Renaud, C., Breton, V., Clarysse, P., Gaudeau, Y., Glatard, T., Jeannot, E., Legré, Y., Loomis, C., Magnin, I. E., Montagnat, J., et al. (2005) · Journal of Clinical Monitoring and Computing · doi:10.1007/s10877-005-0679-9 · Cited by 47
Kannampallil, T., Li, Z., Zhang, M., Cohen, T., Robinson, D. J., Franklin, A., Zhang, J., & Patel, V. L. (2011) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2011.02.007 · Cited by 46
EBPC: Extended Bit-Plane Compression for Deep Neural Network Inference and Training Accelerators
Cavigelli, L., Rutishauser, G., & Benini, L. (2019) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2019.2950093 · Cited by 46
On predictability of time series
Xu, P., Yin, L., Yue, Z., & Zhou, T. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.02.006 · Cited by 46
Designing and Modeling Smart Environments (Invited Paper)
Das, S. K., & Cook, D. J. (2006) · IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) · doi:10.1109/wowmom.2006.35 · Cited by 46
Closed-system quantum logic network implementation of the Viterbi algorithm
Al‐Rabadi, A. N. (2009) · Facta universitatis - series Electronics and Energetics · doi:10.2298/fuee0901001a · Cited by 46
Compression of Two-Dimensional Images
Lempel, A., & Ziv, J. (1985) · Springer eBooks · doi:10.1007/978-3-642-82456-2_10 · Cited by 46
Self-citationLossless Image Compression Using Super-Spatial Structure Prediction
Zhao, X., & He, Z. (2010) · IEEE Signal Processing Letters · doi:10.1109/lsp.2010.2040925 · Cited by 46
DNABIT Compress-Genome Compression Algorithm
Rajarajeswari, P., & Apparao, A. (2011) · Bioinformation · doi:10.6026/97320630005350 · Cited by 46
Pattern matching image compression: algorithmic and empirical results
Atallah, M. J., Genin, Y., & Szpankowski, W. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.777372 · Cited by 46
Forecasting occurrences of activities
Minor, B., & Cook, D. J. (2017) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2016.09.010 · Cited by 45
Adaptive text mining: inferring structure from sequences
Witten, I. H. (2004) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00084-4 · Cited by 45
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Russell, D. J., Way, S. F., Benson, A. K., & Sayood, K. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-601 · Cited by 45
ZipNN: Lossless Compression for AI Models
Hershcovitch, M., Wood, A. W., Choshen, L., Girmonsky, G., Leibovitz, R., Ozeri, O., Ennmouri, I., Malka, M., Chin, P. S., Sundararaman, S., et al. (2025) · IEEE ... International Conference on Cloud Computing · doi:10.1109/cloud67622.2025.00028 · Cited by 45
Breathwork-induced psychedelic experiences modulate neural dynamics
Lewis-Healey, E., Tagliazucchi, E., Canales‐Johnson, A., & Bekinschtein, T. A. (2024) · Cerebral Cortex · doi:10.1093/cercor/bhae347 · Cited by 45
Topologically Controlled Lossy Compression
Soler, M., Plainchault, M., Conche, B., & Tierny, J. (2018) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2018.00015 · Cited by 45
Effective normalization of complexity measurements for epoch length and sampling frequency
Rapp, P. E., Cellucci, C. J., Korslund, K. E., Watanabe, T., & Jiménez-Montaño, M. A. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.016209 · Cited by 45
Ting, M. Y., & Riskin, E. A. (1994) · IEEE Transactions on Image Processing · doi:10.1109/83.336256 · Cited by 45
Computing Palindromic Factorizations and Palindromic Covers On-line
Tomohiro, I., Sugimoto, S., Inenaga, S., Bannai, H., & Takeda, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07566-2_16 · Cited by 45
Compression and genetic sequence analysis
Rivals, É., Dauchet, M., Delahaye, J.-P., & Delgrange, O. (1996) · Biochimie · doi:10.1016/0300-9084(96)84763-8 · Cited by 45
Faster approximate string matching over compressed text
Navarro, G., Kida, T., Takeda, M., Shinohara, A., & Arikawa, S. (2002) · DCC · doi:10.1109/dcc.2001.917177 · Cited by 45
Grammar-based distance in progressive multiple sequence alignment
Russell, D. J., Otu, H. H., & Sayood, K. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-306 · Cited by 44
DNA-Based Data Storage Systems: A Review of Implementations and Code Constructions
Milenković, O., & Pan, C. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3367748 · Cited by 44
Randomness, Information, and ComplexityPreprint
Grassberger, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.3459 · Cited by 44
Sensitivity of string compressors and repetitiveness measures
Akagi, T., Funakoshi, M., & Inenaga, S. (2022) · Information and Computation · doi:10.1016/j.ic.2022.104999 · Cited by 44
An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
Kontoyiannis, I. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796370 · Cited by 44
Order preserving string compression
Antoshenkov, G., Lomet, D., & Murray, J. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1996.492216 · Cited by 44
Compression-based Modelling of Musical Similarity Perception
Pearce, M. T., & Müllensiefen, D. (2017) · Journal of New Music Research · doi:10.1080/09298215.2017.1305419 · Cited by 43
Set Redundancy, the Enhanced Compression Model, and Methods for Compressing Sets of Similar Images.
Karadimitriou, K. (1996) · Louisiana State University · doi:10.31390/gradschool_disstheses.6258 · Cited by 43
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.