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 501–600 of 1,003
Freschi, V., & Bogliolo, A. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.02.011 · Cited by 43
Genre Classification Via An Lz78-Based String Kernel.
Li, M., & Sleep, R. (2005) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.1415161 · Cited by 43
Effective Strong Dimension in Algorithmic Information and Computational Complexity
Athreya, K. B., Hitchcock, J. M., Lutz, J. H., & Mayordomo, E. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24749-4_55 · Cited by 43
AUTOMATE, a computing package for automata and finite semigroups
Champarnaud, J.-M., & Hansel, G. (1991) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80125-3 · Cited by 43
Semi-local string comparison: algorithmic techniques and applicationsPreprint
Tiskin, A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.3619 · Cited by 43
MLC: An Efficient Multi-level Log Compression Method for Cloud Backup Systems
Feng, B., Wu, C., & Li, J. (2016) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2016.0215 · Cited by 42
Prediction with a short memory
Sharan, V., Kakade, S. M., Liang, P., & Valiant, G. J. (2018) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3188745.3188954 · Cited by 42
Cowic: A Column-Wise Independent Compression for Log Stream Analysis
Lin, H., Zhou, J., Yao, B., Guo, M., & Li, J. (2015) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2015.45 · Cited by 42
Information Compression in the AI Era: Recent Advances and Future Challenges
Chen, J., Fang, Y., Khisti, A. J., Özgür, A., & Shlezinger, N. (2025) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2025.3560359 · Cited by 42
Reordering rows for better compression: Beyond the lexicographic order
Lemire, D., Kaser, O., & Gutarra, E. (2012) · ACM Transactions on Database Systems · doi:10.1145/2338626.2338633 · Cited by 42
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
Jacquet, P., Szpankowski, W., & Tang, J. (2001) · Algorithmica · doi:10.1007/s00453-001-0053-3 · Cited by 42
Analytic Pattern Matching: From DNA to Twitter
Jacquet, P., & Szpankowski, W. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9780511843204 · Cited by 42
Exploring Predictability in Mobile Interaction
Marin, R., Dobre, C., & Xhafa, F. (2012) · International Conference on Emerging Intelligent Data and Web Technologies · doi:10.1109/eidwt.2012.29 · Cited by 42
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
Al-Hafeedh, A. M., Crochemore, M., Ilie, L., Kopylova, E., Smyth, W. F., Tischler, G., & Yusufu, M. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379781 · Cited by 42
A Randomly Accessible Lossless Compression Scheme for Time-Series Data
Vestergaard, R., Lucani, D. E., & Zhang, Q. (2020) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom41043.2020.9155450 · Cited by 42
A Space-Saving Approximation Algorithm for Grammar-Based Compression
Sakamoto, H., Maruyama, S., Kida, T., & Shimozono, S. (2009) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e92.d.158 · Cited by 42
Hartman, A., & Rodeh, M. (1985) · Springer eBooks · doi:10.1007/978-3-642-82456-2_11 · Cited by 42
MARVLE: a VLSI chip for data compression using tree-based codes
Mukherjee, A., Ranganathan, N., Flieder, J. W., & Acharya, T. (1993) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.238415 · Cited by 42
CMOS Image Sensor with On-Chip Image Compression: A Review and Performance Analysis
Zhang, M., & Bermak, A. (2010) · Journal of Sensors · doi:10.1155/2010/920693 · Cited by 41
Odess: Speeding up Resemblance Detection for Redundancy Elimination by Fast Content-Defined Sampling
Zou, X., Deng, C., Xia, W., Shilane, P., Tan, H., Zhang, H., & Wang, X. (2021) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde51399.2021.00048 · Cited by 41
Mobility-Aware Efficient Job Scheduling in Mobile Grids
Ghosh, P., Roy, N., & Das, S. K. (2007) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2007.73 · Cited by 41
New methods for lossless image compression using arithmetic coding
Howard, P. G., & Vitter, J. S. (2002) · DCC · doi:10.1109/dcc.1991.213355 · Cited by 41
A Technique for High Ratio LZW Compression
Knieser, M. J., Wolff, F., Papachristou, C., Weyer, D., & McIntyre, D. R. (2003) · Design, Automation, and Test in Europe · doi:10.5555/789083.1022714 · Cited by 41
Searching and Indexing Genomic Databases via Kernelization
Gagie, T., & Puglisi, S. J. (2015) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2015.00012 · Cited by 41
Distributed Distortion-Rate Optimized Compressed Sensing in Wireless Sensor Networks
Leinonen, M., Codreanu, M., & Juntti, M. J. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2790385 · Cited by 41
Automatic inference of models for statistical code compression
Fraser, C. W. (1999) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/301618.301672 · Cited by 41
LZgrep: a Boyer-Moore string matching tool for Ziv-Lempel compressed text
Navarro, G., & Tarhio, J. (2005) · Software Practice and Experience · doi:10.1002/spe.663 · Cited by 41
A unifying framework for compressed pattern matching
Kida, T., Shibata, Y., Takeda, M., Shinohara, A., & Arikawa, S. (2003) · String Processing and Information Retrieval · doi:10.1109/spire.1999.796582 · Cited by 41
An Accuracy Metric: Percentages, Randomness, and Probabilities
Fisher, C. W., Lauria, E. J. M., & Matheus, C. C. (2009) · Journal of Data and Information Quality · doi:10.1145/1659225.1659229 · Cited by 40
“LZ complexity and derived LZ algorithms [Ziv and Lempel 1977; 1978] underlie the whole .eld of dictionary-based lossless compression, and has triggered a huge amount of research, algorithms, and application software (most desktop general-purpose compression software such as PKZIP and WINZIP are…”
MethodOn principles of emergent organization
Rupe, A., & Crutchfield, J. P. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.04.001 · Cited by 40
Complexity and meaning in nonlinear dynamical systems
Atmanspacher, H., Kurths, J., Scheingraber, H., Wackerbauer, R., & Witt, A. (1992) · Open Systems & Information Dynamics · doi:10.1007/bf02228949 · Cited by 40
DeepSqueeze: Deep Semantic Compression for Tabular Data
Ilkhechi, A., Crotty, A., Galakatos, A., Mao, Y., Fan, G., Shi, X., & Çetintemel, U. (2020) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3318464.3389734 · Cited by 40
Design and Implementation of FPGA-based Systolic Array for LZ Data Compression
Ghany, M. A. A. E., Salama, A. E., & Khalil, A. H. (2007) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2007.378644 · Cited by 40
Efficient Compression and Encryption for Digital Data Transmission
Carpentieri, B. (2018) · Security and Communication Networks · doi:10.1155/2018/9591768 · Cited by 40
Predicting future locations using prediction-by-partial-match
Burbey, I., & Martin, T. L. (2008) · ACM International Workshop on Mobile Entity Localization and Tracking in GPS-less Environments (MELT) · doi:10.1145/1410012.1410014 · Cited by 40
Asymptotic Properties on Codeword Lengths of an Optimal FV Code for General Sources
Koga, H., & Yamamoto, H. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844098 · Cited by 40
Dynamical systems and computable information
Benci, V., Bonanno, C., Galatolo, S., Menconi, G., & Virgilio, M. (2004) · Discrete and Continuous Dynamical Systems - B · doi:10.3934/dcdsb.2004.4.935 · Cited by 40
Approximate String Matching over Ziv—Lempel Compressed Text
Kärkkäinen, J., Navarro, G., & Ukkonen, E. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45123-4_18 · Cited by 40
The algorithmic complexity of multichannel EEGs is sensitive to changes in behavior
Watanabe, T., Cellucci, C. J., Kohegyi, E., Bashore, T. R., Josiassen, R. C., Greenbaun, N. N., & Rapp, P. E. (2003) · Psychophysiology · doi:10.1111/1469-8986.00009 · Cited by 39
Using general-purpose compression algorithms for music analysis
Louboutin, C., & Meredith, D. (2016) · Journal of New Music Research · doi:10.1080/09298215.2015.1133656 · Cited by 39
Controlled Information Transfer Through An In Vivo Nervous System
Abbasi, N. A., Lafci, D., & Akan, Ö. B. (2018) · Scientific Reports · doi:10.1038/s41598-018-20725-2 · Cited by 39
DNA Sequence Classification Using Compression-Based Induction
Loewenstern, D., Noordewier, M., Yianilos, P., & Hirsh, H. (1995) · Rutgers University Community Repository (Rutgers University) · doi:10.7282/t3sj1q2q · Cited by 39
Roy, A., Das, S. K., & Misra, A. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1325892 · Cited by 39
Prospects and limitations of full-text index structures in genome analysis
Vyverman, M., Baets, B. D., Fack, V., & Dawyndt, P. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks408 · Cited by 39
An Online Algorithm for Lightweight Grammar-Based Compression
Maruyama, S., Sakamoto, H., & Takeda, M. (2012) · Algorithms · doi:10.3390/a5020214 · Cited by 39
Said, A. (2003) · Elsevier eBooks · doi:10.1016/b978-012620861-0/50006-1 · Cited by 39
Amigó, J. M., Kocarev, L., & Tomovski, I. (2007) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2007.03.001 · Cited by 39
A study on word-based and integral-bit Chinese text compression algorithms
Cheng, K.-S., Young, G. H., & Wong, K. (1999) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(1999)50:3<218::aid-asi4>3.0.co;2-1 · Cited by 38
Statistical power: Implications for planning MEG studies
Chaumon, M., Puce, A., & George, N. (2021) · NeuroImage · doi:10.1016/j.neuroimage.2021.117894 · Cited by 38
On Distribution Preserving QuantizationPreprint
Li, M., Klejsa, J., & Kleijn, W. B. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.3728 · Cited by 38
Exponentiation in finite fields: Theory and practice
Gathen, J. V. Z., & Nöcker, M. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63163-1_8 · Cited by 38
Minimum Complexity Pursuit for Universal Compressed Sensing
Jalali, S., Maleki, A., & Baraniuk, R. G. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2302005 · Cited by 38
Compression-Based Compressed Sensing
Rezagah, F. E., Jalali, S., Erkip, E., & Poor, H. V. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2726549 · Cited by 38
Modeling musical anticipation: From the time of music to the music of time
Dubnov, S., & Cont, A. (2008) · eScholarship (California Digital Library) · Cited by 38
Text Compression and Encryption through Smart Devices for Mobile Communication
Pizzolante, R., Carpentieri, B., Castiglione, A., Castiglione, A., & Palmieri, F. (2013) · International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS) · doi:10.1109/imis.2013.121 · Cited by 38
A Primer on Compression in the Memory Hierarchy
Sardashti, S., Arelakis, A., Stenström, P., & Wood, D. A. (2015) · Synthesis lectures on computer architecture · doi:10.2200/s00683ed1v01y201511cac036 · Cited by 38
Configuration management techniques for reconfigurable computing
Hauck, S., & Li, Z. (2002) · Cited by 38
Lossless Image Compression by Block Matching
Storer, J. A. (1997) · The Computer Journal · doi:10.1093/comjnl/40.2_and_3.137 · Cited by 38
Adaptive compressed caching: design and implementation
Castro, R., Lago, A. P. D., & da Silva, D. (2004) · International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD) · doi:10.1109/cahpc.2003.1250316 · Cited by 38
Some theory and practice of greedy off-line textual substitution
Apostolico, A., & Lonardi, S. (2002) · DCC · doi:10.1109/dcc.1998.672138 · Cited by 38
Yang, E., Kaltchenko, A., & Kieffer, J. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.945239 · Cited by 38
Searching BWT compressed text with the Boyer-Moore algorithm and binary search
Bell, T., Powell, M., Mukherjee, A., & Adjeroh, D. (2003) · DCC · doi:10.1109/dcc.2002.999949 · Cited by 38
Mache: no-loss trace compaction
Samples, A. D. (1989) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/75372.75382 · Cited by 38
Measuring the Efficiency of the Intraday Forex Market with a Universal Data Compression Algorithm
Shmilovici, A., Kahiri, Y., Ben‐Gal, I., & Hauser, S. (2008) · Computational Economics · doi:10.1007/s10614-008-9153-3 · Cited by 37
Longest‐match string searching for ziv‐lempel compression
Bell, T., & Kulp, D. (1993) · Software Practice and Experience · doi:10.1002/spe.4380230705 · Cited by 37
A compressed self-index using a Ziv–Lempel dictionary
S.Russo, L. M., & Oliveira, A. L. (2008) · Information Retrieval · doi:10.1007/s10791-008-9050-3 · Cited by 37
Using compression to improve chip multiprocessor performance
Wood, D. A., & Alameldeen, A. R. (2006) · Cited by 37
Moon, T., & Weissman, T. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2009894 · Cited by 37
Towards Efficient Archiving of Dynamic Linked Open Data.
Fernández, J. D., Polleres, A., & Umbrich, J. (2015) · Cited by 37
The word entropy of natural languagesPreprint
Bentz, C., & Alikaniotis, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.06996 · Cited by 37
String matching with preprocessing of text and pattern
Naor, M. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54233-7_179 · Cited by 37
A lossless image compression algorithm using variable block size segmentation
Ranganathan, N., Romaniuk, S. G., & Namuduri, K. R. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.465104 · Cited by 37
Compression without a common prior: An information-theoretic justification for ambiguity in language
Juba, B., Kalai, A. T., Khanna, S., & Sudan, M. (2011) · ScholarlyCommons (University of Pennsylvania) · Cited by 36
Electrophysiological entropy in younger adults, older controls and older cognitively declined adults
Hogan, M., Kilmartin, L., Keane, M., Collins, P. A. W., Staff, R. T., Kaiser, J., Lai, R. Y. K., & Upton, N. (2012) · Brain Research · doi:10.1016/j.brainres.2012.01.027 · Cited by 36
Unique Reconstruction of Coded Strings From Multiset Substring Spectra
Gabrys, R., & Milenković, O. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2935973 · Cited by 36
Grammar-based Compression of DNA Sequences
Cherniavsky, N., & Ladner, R. E. (2007) · Cited by 36
Compressed Text Indexes:From Theory to Practice!Preprint
Ferragina, P., González, R., Navarro, G., & Venturini, R. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.3360 · Cited by 36
Variable-rate trellis source encoding
Yang, E., & Zhang, Z. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.749005 · Cited by 36
Music Analysis and Point-Set Compression
Meredith, D. (2015) · Journal of New Music Research · doi:10.1080/09298215.2015.1045003 · Cited by 36
2D-pattern matching image and video compression: theory, algorithms, and experiments
Alzina, M., Szpankowski, W., & Grama, A. Y. (2002) · IEEE Transactions on Image Processing · doi:10.1109/83.988964 · Cited by 36
Yang, E., & He, D. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2040867 · Cited by 36
Microarray image compression: SLOCO and the effect of information loss
Jörnsten, R. J., Wang, W., Yu, B., & Ramchandran, K. (2003) · Signal Processing · doi:10.1016/s0165-1684(02)00478-4 · Cited by 36
Information and dynamical systems: a concrete measurement on sporadic dynamics
Argenti, F., Benci, V., Cerrai, P., Cordelli, A., Galatolo, S., & Menconi, G. (2002) · Chaos Solitons & Fractals · doi:10.1016/s0960-0779(01)00028-5 · Cited by 36
Nath, P., Urgaonkar, B., & Sivasubramaniam, A. (2008) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/1383422.1383428 · Cited by 35
The impact of human mobility data scales and processing on movement predictability
Smolak, K., Siła-Nowicka, K., Delvenne, J., Wierzbiński, M., & Rohm, W. (2021) · Scientific Reports · doi:10.1038/s41598-021-94102-x · Cited by 35
Optimal Prediction for Prefetching in the Worst Case
Krishnan, P., & Vitter, J. S. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794261817 · Cited by 35
Predicting Future Locations and Arrival Times of Individuals
Burbey, I. (2011) · VTechWorks (Virginia Tech) · Cited by 35
An efficient binary storage format for IFC building models using HDF5 hierarchical data format
Krijnen, T., & Beetz, J. (2020) · Automation in Construction · doi:10.1016/j.autcon.2020.103134 · Cited by 35
A Lossless Color Image Compression Architecture Using a Parallel Golomb-Rice Hardware CODEC
Kim, H., Lee, J.-H., Kim, H., Kang, S., & Park, W. C. (2011) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2011.2129350 · Cited by 35
Fast q-gram mining on SLP compressed strings
Goto, K., Bannai, H., Inenaga, S., & Takeda, M. (2012) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2012.07.006 · Cited by 35
Calude, C. S., Salomaa, K., & Roblot, T. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.06.021 · Cited by 35
Dynamic lightweight text compression
Brisaboa, N. R., Fariña, A., Navarro, G., & Paramá, J. R. (2010) · ACM Transactions on Information Systems · doi:10.1145/1777432.1777433 · Cited by 35
Characterization of EEGs in Alzheimer's Disease using Information Theoretic Methods
Zhao, P., Eetvelt, P. V., Goh, C., Hudson, N. R., Wimalaratna, S., & Ifeachor, E. (2007) · Conference proceedings · doi:10.1109/iembs.2007.4353494 · Cited by 35
A new lossy compression algorithm for wireless sensor networks using Bayesian predictive coding
Chen, C., Zhang, L., & Tiong, R. L. K. (2020) · Wireless Networks · doi:10.1007/s11276-020-02425-w · Cited by 35
The design of an adaptive on-line binary arithmetic-coding chip
Kuang, S.-R., Jou, J. M., & Chen, Y.-L. (1998) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.703836 · Cited by 35
100 Mbit/s adaptive data compressor design using selectively shiftable content-addressable memory
Jones, S. (1992) · IEE Proceedings G Circuits Devices and Systems · doi:10.1049/ip-g-2.1992.0078 · Cited by 35
Compression, Tests for Randomness and Estimating the Statistical Model of an Individual Sequence
Ziv, J. (1990) · Springer eBooks · doi:10.1007/978-1-4612-3352-7_29 · Cited by 34
Self-citationA Hierarchical Compression Technique for 3D Gaussian Splatting Compression
Huang, H., Huang, W., Yang, Q., Xu, Y., & Li, Z. (2025) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49660.2025.10887742 · Cited by 34
Study of LZ-Based Location Prediction and Its Application to Transportation Recommender Systems
Rodríguez-Carrión, A., García-Rubio, C., Campo, C., Cortés, A. S., Garcia-Lozano, E., & Noriega-Vivas, P. (2012) · Sensors · doi:10.3390/s120607496 · Cited by 34
Stonier, T. (1990) · Springer eBooks · doi:10.1007/978-1-4471-3265-3_8 · Cited by 34
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.