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 201–300 of 1,003
Natural Language Statistical Features of LSTM-Generated Texts
Lippi, M., Montemurro, M. A., Esposti, M. D., & Cristadoro, G. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2890970 · Cited by 104
A Pipeline for Computational Historical Linguistics
Steiner, L., Cysouw, M., & Stadler, P. F. (2011) · Language Dynamics and Change · doi:10.1163/221058211x570358 · Cited by 104
Data Reduction Techniques for Simulation, Visualization and Data Analysis
Li, S., Marsaglia, N., Garth, C., Woodring, J., Clyne, J., & Childs, H. (2018) · Computer Graphics Forum · doi:10.1111/cgf.13336 · Cited by 103
Data Compression Algorithms for Wireless Sensor Networks: A Review and Comparison
Ketshabetswe, L. K., Zungeru, A. M., Mtengi, B., Lebekwe, C. K., & Prabaharan, S. R. S. (2021) · IEEE Access · doi:10.1109/access.2021.3116311 · Cited by 103
Lightweight natural language text compression
Brisaboa, N. R., Fariña, A., Navarro, G., & Paramá, J. R. (2006) · Information Retrieval · doi:10.1007/s10791-006-9001-9 · Cited by 103
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
Shamir, G. I., & Merhav, N. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771150 · Cited by 102
Lossless image compression: a comparative study
Memon, N. D., & Sayood, K. (1995) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.204127 · Cited by 102
Variations on a theme by Ziv and Lempel
Miller, V. S., & Wegman, M. N. (1985) · Springer eBooks · doi:10.1007/978-3-642-82456-2_9 · Cited by 102
Effects of External Stimulation on Psychedelic State Neurodynamics
Mediano, P. A. M., Rosas, F. E., Timmermann, C., Roseman, L., Nutt, D. J., Feilding, A., Kaelen, M., Kringelbach, M. L., Barrett, A. B., Seth, A. K., et al. (2024) · ACS Chemical Neuroscience · doi:10.1021/acschemneuro.3c00289 · Cited by 101
Average redundancy rate of the Lempel-Ziv code
Louchard, G., & Szpankowski, W. (1997) · DCC · doi:10.1109/18.567640 · Cited by 101
Entropy estimation of very short symbolic sequences
Lesne, A., Blanc, J.-L., & Pézard, L. (2009) · Physical Review E · doi:10.1103/physreve.79.046208 · Cited by 101
Rate Distortion Optimization for H.264 Interframe Coding: A General Framework and Algorithms
Yang, E., & Yu, X. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.896685 · Cited by 101
Creating small fault dictionaries [logic circuit fault diagnosis]
Chess, B., & Larrabee, T. (1999) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.748164 · Cited by 101
Using the Google N-Gram corpus to measure cultural complexity
Juola, P. (2013) · Literary and Linguistic Computing · doi:10.1093/llc/fqt017 · Cited by 100
Low-algorithmic-complexity entropy-deceiving graphs
Zenil, H., Kiani, N. A., & Tegner, J. N. (2017) · Physical review. E · doi:10.1103/physreve.96.012308 · Cited by 100
Universal schemes for sequential decision from individual data sequences
Merhav, N., & Feder, M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243445 · Cited by 100
Plotnik, E., Weinberger, M. J., & Ziv, J. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.108250 · Cited by 99
Self-citationOptimal sequential probability assignment for individual sequences
Weinberger, M. J., Merhav, N., & Feder, M. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.312161 · Cited by 98
Journal of Digital Forensics, Security and Law
Lae (2014) · ADVANCED SCIENCES INDEX · Cited by 98
Language of fungi derived from their electrical spiking activity
Adamatzky, A. (2022) · Royal Society Open Science · doi:10.1098/rsos.211926 · Cited by 98
A fast block-sorting algorithm for lossless data compression
Schindler, M. (1997) · DCC · doi:10.1109/dcc.1997.582137 · Cited by 98
Logzip: Extracting Hidden Structures via Iterative Clustering for Log Compression
Liu, J., Zhu, J., He, S., He, P., Zheng, Z., & Lyu, M. R. (2019) · 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2019.00085 · Cited by 97
Modern lossless compression techniques: Review, comparison and analysis
Gupta, A., Bansal, A., & Khanduja, V. (2017) · International Conference on Electrical, Computer and Communication Technologies (ICECCT) · doi:10.1109/icecct.2017.8117850 · Cited by 97
An Evaluation of Model-Based Approaches to Sensor Data Compression
Nguyen, Q. V. H., Jeung, H., & Aberer, K. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.237 · Cited by 97
Compressing Genomic Sequence Fragments Using S lim G ene
Kozanitis, C., Saunders, C. T., Kruglyak, S., Bafna, V., & Varghese, G. (2011) · Journal of Computational Biology · doi:10.1089/cmb.2010.0253 · Cited by 97
A fully linear-time approximation algorithm for grammar-based compression
Sakamoto, H. (2004) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2004.08.016 · Cited by 97
Evaluating methods for computer-assisted stemmatology using artificial benchmark data sets
Roos, T., & Heikkilä, T. (2009) · Literary and Linguistic Computing · doi:10.1093/llc/fqp002 · Cited by 96
Location aware resource management in smart homes
Roy, A., Bhaumik, S. K. D., Bhattacharya, A., Basu, K., Cook, D. J., & Das, S. K. (2004) · IEEE International Conference on Pervasive Computing and Communications · doi:10.1109/percom.2003.1192773 · Cited by 96
Compression by induction of hierarchical grammars
Nevill-Manning, C. G., Witten, I. H., & Maulsby, D. (2002) · DCC · doi:10.1109/dcc.1994.305932 · Cited by 96
Universal Entropy of Word Ordering Across Linguistic Families
Montemurro, M. A., & Zanette, D. H. (2011) · PLoS ONE · doi:10.1371/journal.pone.0019875 · Cited by 95
Learning probabilistic prediction functions
Santis, A. D., Markowsky, G., & Wegman, M. N. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21929 · Cited by 95
Resolution of the Burrows-Wheeler Transform Conjecture
Kempa, D., & Kociumaka, T. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00097 · Cited by 95
Semi-local String Comparison: Algorithmic Techniques and Applications
Tiskin, A. (2008) · Mathematics in Computer Science · doi:10.1007/s11786-007-0033-3 · Cited by 95
(S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
Brisaboa, N. R., Fariña, A., Navarro, G., & Esteller, M. F. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39984-1_10 · Cited by 95
A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
Langdon, G. G. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056645 · Cited by 94
SPEED: An Inhabitant Activity Prediction Algorithm for Smart Homes
Alam, M. R., Reaz, M. B. I., & Mohd Ali, M. A. (2012) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2011.2173568 · Cited by 93
Cui, L., Gong, X., Zhang, J., & Wang, H. (2016) · Journal of Sound and Vibration · doi:10.1016/j.jsv.2016.09.008 · Cited by 93
Consciousness & Brain Functional Complexity in Propofol Anaesthesia
Varley, T. F., Luppi, A. I., Pappas, I., Naçi, L., Ram, A., Owen, A. M., Menon, D. K., & Stamatakis, E. A. (2020) · Scientific Reports · doi:10.1038/s41598-020-57695-3 · Cited by 93
One-Lead ECG-based Personal Identification Using Ziv-Merhav Cross Parsing
Coutinho, D., Fred, A. L. N., & Figueiredo, M. A. T. (2010) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2010.940 · Cited by 93
Improved Grammar-Based Compressed Indexes
Claude, F., & Navarro, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34109-0_19 · Cited by 93
Redundancy of the Lempel-Ziv incremental parsing rule
Savari, S. A. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.567642 · Cited by 93
Java bytecode compression for low-end embedded systems
Clausen, L. R., Schultz, U. P., Consel, C., & Muller, G. (2000) · ACM Transactions on Programming Languages and Systems · doi:10.1145/353926.353933 · Cited by 93
A Predictive Framework for Location-Aware Resource Management in Smart Homes
Roy, A., Das, S. K., & Basu, K. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1058 · Cited by 92
A Lossless Embedded Compression Using Significant Bit Truncation for HD Video Coding
Kim, J. M., & Kyung, C. (2010) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2010.2045923 · Cited by 92
A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions
Zenil, H. (2020) · Entropy · doi:10.3390/e22060612 · Cited by 91
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
Tan, V. Y. F. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988539 · Cited by 91
On using lossless compression of debug data in embedded logic analysis
Daoud, E. A., & Nicolici, N. (2007) · IEEE International Test Conference (ITC) · doi:10.1109/test.2007.4437613 · Cited by 91
Experimental evidence of quantum randomness incomputability
Calude, C. S., Dinneen, M. J., Dumitrescu, M. E. B., & Svozil, K. (2010) · Physical Review A · doi:10.1103/physreva.82.022102 · Cited by 90
Data Compression in Scientific and Statistical Databases
Bassiouni, M. A. (1985) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1985.231852 · Cited by 90
FSST: fast random access string compression
Boncz, P. A., Neumann, T., & Leis, V. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3407790.3407851 · Cited by 90
3D point cloud compression using conventional image compression for efficient data transmission
Houshiar, H., & Nüchter, A. (2015) · International Conference on Information, Communication and Automation Technologies (ICAT) · doi:10.1109/icat.2015.7340499 · Cited by 90
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
Yang, E., & Kieffer, J. C. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481794 · Cited by 90
A sequential algorithm for the universal coding of finite memory sources
Weinberger, M. J., Lempe, A., & Ziv, J. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.135641 · Cited by 90
Self-citationQuery execution in column-oriented database systems
Madden, S. R., & Abadi, D. J. (2008) · Cited by 90
ACTIVE LEZI: AN INCREMENTAL PARSING ALGORITHM FOR SEQUENTIAL PREDICTION
GOPALRATNAM, K., & COOK, D. J. (2004) · International Journal on Artificial Intelligence Tools · doi:10.1142/s0218213004001892 · Cited by 89
Designing Smart Environments: A Paradigm Based on Learning and Prediction
Das, S. K., & Cook, D. J. (2005) · Lecture notes in computer science · doi:10.1007/11590316_11 · Cited by 89
Weighted Ancestors in Suffix Trees Revisited
Belazzougui, D., Kosolobov, D., Puglisi, S. J., & Raman, R. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.cpm.2021.8 · Cited by 89
Multiscan-based test compression and hardware decompression using LZ77
Wolff, F., & Papachristou, C. (2003) · IEEE International Test Conference (ITC) · doi:10.1109/test.2002.1041776 · Cited by 89
Compression of embedded system programs
Kozuch, M. A., & Wolfe, A. (2002) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd.1994.331903 · Cited by 89
Compactly encoding unstructured inputs with differential compression
Ajtai, M., Burns, R. C., Fagin, R., Long, D. D. E., & Stockmeyer, L. J. (2002) · Journal of the ACM · doi:10.1145/567112.567116 · Cited by 89
The Information Lost in Erasures
Verdú, S., & Weissman, T. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929968 · Cited by 88
TEXT COMPRESSION ALGORITHMS - A COMPARATIVE STUDY
Senthil, S. T., & Robert, L. (2011) · ICTACT Journal on Communication Technology · doi:10.21917/ijct.2011.0062 · Cited by 88
Inferring Sequential Structure
Nevill-Manning, C. G. (1996) · Cited by 88
Kreft, S., & Navarro, G. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21458-5_6 · Cited by 87
On data mining, compression, and Kolmogorov complexity
Faloutsos, C., & Megalooikonomou, V. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0057-3 · Cited by 86
Indexing Highly Repetitive String Collections, Part II: Compressed Indexes
Navarro, G. (2021) · ACM Computing Surveys · doi:10.1145/3432999 · Cited by 86
A compression scheme for radio data in high performance computing
Masui, K. W., Amiri, M., Connor, L., Deng, M., Fandino, M., Höfer, C., Halpern, M., Hanna, D., Hincks, A. D., Hinshaw, G., et al. (2015) · Astronomy and Computing · doi:10.1016/j.ascom.2015.07.002 · Cited by 86
Barcoding Human Physical Activity to Assess Chronic Pain Conditions
Paraschiv-Ionescu, A., Perruchoud, C., Buchser, E., & Aminian, K. (2012) · PLoS ONE · doi:10.1371/journal.pone.0032239 · Cited by 85
Gbit/s lossless data compression hardware
Nunez-Yanez, J. L., & Jones, S. (2003) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2003.812288 · Cited by 85
A survey of the theory of source coding with a fidelity criterion
Kieffer, J. C. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259634 · Cited by 85
An Efficient Compression Code for Text Databases
Brisaboa, N. R., Iglesias, E. L., Navarro, G., & Paramá, J. R. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36618-0_33 · Cited by 85
Code and parse trees for lossless source encoding
Abrahams, J. (2002) · Compression and Complexity of Sequences (SEQUENCES) · doi:10.1109/sequen.1997.666911 · Cited by 85
Claude E. Shannon: a retrospective on his life, work, and impact
Gallager, R. G. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959253 · Cited by 84
Context-based lossless and near-lossless compression of EEG signals
Memon, N. D., Kong, X., & Cinkler, J. (1999) · IEEE Transactions on Information Technology in Biomedicine · doi:10.1109/4233.788586 · Cited by 84
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Behm, A., Ji, S., Li, C., & Lu, J. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.32 · Cited by 83
Integrated, Not Isolated: Defining Typological Proximity in an Integrated Multilingual Architecture
Putnam, M. T., Carlson, M. T., & Reitter, D. (2018) · Frontiers in Psychology · doi:10.3389/fpsyg.2017.02212 · Cited by 83
Digital Signal Compression: Principles and Practice
Pearlman, W. A., & Said, A. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511984655 · Cited by 83
Lossless compression of volume data
Fowler, J. E., & Yagel, R. (1994) · doi:10.1145/197938.197961 · Cited by 83
Location Prediction Algorithms for Mobile Wireless Systems
van den Berg, E., Jain, R., & Cheng, C. T. (2003) · Internet and communications · doi:10.1201/9780203011690.ch11 · Cited by 82
On the correlation between size and metric validity
Gil, Y., & Lalouche, G. (2017) · Empirical Software Engineering · doi:10.1007/s10664-017-9513-5 · Cited by 82
Evaluating location predictors with extensive Wi-Fi mobility data
Song, L., Kotz, D. F., Jain, R., & He, X. (2003) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/965732.965747 · Cited by 82
Mache: no-loss trace compaction
Samples, A. D. (1989) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/75108.75382 · Cited by 82
Clustering in mobile ad hoc networks through neighborhood stability-based mobility prediction
Konstantopoulos, C. G., Gavalas, D., & Pantziou, G. E. (2008) · Computer Networks · doi:10.1016/j.comnet.2008.01.018 · Cited by 81
High-speed VLSI designs for Lempel-Ziv-based data compression
Ranganathan, N., & Henriques, S. (1993) · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · doi:10.1109/82.219839 · Cited by 81
Pal, D., Li, D., Dean, J. G., Brito, M. A., Liu, T., Fryzel, A. M., Hudetz, A. G., & Mashour, G. A. (2020) · The Journal of Neuroscience · doi:10.1523/jneurosci.1910-19.2019 · Cited by 80
“Lempel–Ziv complexity computes the complexity of data with finite length sequences (Lempel and Ziv, 1976; Ziv and Lempel, 1977, 1978) and has been shown to be a valuable tool to investigate the neurophysiological changes associated with states of consciousness (Casali et al., 2013; Abásolo et al.,…”
BackgroundAn equivalent Markov model for burst errors in digital channels
Sivaprakasam, S., & Shanmugan, K. S. (1995) · IEEE Transactions on Communications · doi:10.1109/26.380185 · Cited by 80
Algorithms for Delta Compression and Remote File Synchronization
Suel, T., & Memon, N. D. (2003) · Elsevier eBooks · doi:10.1016/b978-012620861-0/50014-0 · Cited by 80
Varley, T. F., Craig, M. M., Ram, A., Finoia, P., Williams, G. B., Alanson, J., Pickard, J. D., Menon, D. K., & Stamatakis, E. A. (2020) · PLoS ONE · doi:10.1371/journal.pone.0223812 · Cited by 79
Yu, F. R., & Leung, V. C. M. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916771 · Cited by 79
Block-oriented compression techniques for large statistical databases
Ng, W. K., & Ravishankar, C. V. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.591455 · Cited by 79
Utility of AdaBoost to Detect Sleep Apnea-Hypopnea Syndrome From Single-Channel Airflow
Gutiérrez‐Tobal, G. C., Álvarez, D., del Campo, F., & Hornero, R. (2015) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2015.2467188 · Cited by 78
New methods for lossless image compression using arithmetic coding
Howard, P. G., & Vitter, J. S. (1992) · Information Processing & Management · doi:10.1016/0306-4573(92)90067-a · Cited by 78
DeepBot: a time-based botnet detection with deep learning
Shi, W.-C., & Sun, H. (2020) · Soft Computing · doi:10.1007/s00500-020-04963-z · Cited by 77
Variable rate vector quantization for medical image compression
Riskin, E. A., Lookabaugh, T. D., Chou, P. A., & Gray, R. M. (1990) · IEEE Transactions on Medical Imaging · doi:10.1109/42.57766 · Cited by 77
A fast compression-based similarity measure with applications to content-based image retrieval
Cerra, D., & Datcu, M. P. (2011) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2011.10.009 · Cited by 76
A Volumetric Approach to Point Cloud Compression–Part II: Geometry Compression
Krivokuća, M., Chou, P. A., & Koroteev, M. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2957853 · Cited by 76
Klein, S. T., & Wiseman, Y. (2004) · Discrete Applied Mathematics · doi:10.1016/j.dam.2004.04.013 · Cited by 76
An interdisciplinary comparison of sequence modeling methods for next-element prediction
Tax, N., Teinemaa, I., & van Zelst, S. J. (2020) · Software & Systems Modeling · doi:10.1007/s10270-020-00789-3 · Cited by 75
MesonGS: Post-training Compression of 3D Gaussians via Efficient Attribute Transformation
Xie, S., Zhang, W., Tang, C., Bai, Y., Lu, R., Ge, S., & Wang, Z. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-73414-4_25 · Cited by 75
Analyse de données géométriques, au delà des convolutions
Feydy, J. (2020) · theses.fr (ABES) · doi:10.70675/e788178aze133z4951zb8b4zf9614c9e629c · Cited by 75
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.