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 601–700 of 1,003
Are Current Advances of Compression Algorithms for Capsule Endoscopy Enough? A Technical Review
Alam, M. W., Hasan, M. M., Mohammed, S. K., Deeba, F., & Wahid, K. A. (2017) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2017.2757013 · Cited by 34
PILC: Practical Image Lossless Compression with an End-to-end GPU Oriented Neural Framework
Kang, N., Qiu, S., Zhang, S., Li, Z., & Xia, S. (2022) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52688.2022.00372 · Cited by 34
Cont, A., Dubnov, S., & Assayag, G. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74262-3_16 · Cited by 34
Clustering di-graphs for continuously verifying users according to their typing patterns
Shimshon, T., Moskovitch, R., Rokach, L., & Elovici, Y. (2010) · IEEE Convention of Electrical and Electronics Engineers in Israel · doi:10.1109/eeei.2010.5662182 · Cited by 34
Lossless Compression of Time Series Data with Generalized Deduplication
Vestergaard, R., Zhang, Q., & Lucani, D. E. (2019) · Globecom · doi:10.1109/globecom38437.2019.9013957 · Cited by 34
Comparison Study of Lossless Data Compression Algorithms for Text Data
Bhattacharjee, A. K. (2013) · IOSR Journal of Computer Engineering · doi:10.9790/0661-1161519 · Cited by 34
The effect of non-greedy parsing in Ziv-Lempel compression methods
Horspool, R. N. (2002) · DCC · doi:10.1109/dcc.1995.515520 · Cited by 34
Cascaded differential and wavelet compression of chromosome images
Liu, Z., Xiong, Z., Wu, Q., Wang, Y., & Castleman, K. R. (2002) · IEEE Transactions on Biomedical Engineering · doi:10.1109/10.991165 · Cited by 34
Hierarchical partition priority wavelet image compression
EFSTRATIADIS, S. N., Tzovaras, D. K., & Strintzis, M. G. (1996) · IEEE Transactions on Image Processing · doi:10.1109/83.502391 · Cited by 34
New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm
Bender, P. E., & Wolf, J. K. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.79942 · Cited by 34
Universal lossless source coding with the Burrows Wheeler transform
Effros, M. (1999) · DCC · doi:10.1109/dcc.1999.755667 · Cited by 34
A Double-Adaptive File Compression Algorithm
Langdon, G. G., & Rissanen, J. (1983) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1983.1095765 · Cited by 34
Park, J., Kim, J., Kim, Y., Lee, S., & Mutlu, O. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2202.10584 · Cited by 34
Unsupervised Discovery of Recurring Speech Patterns Using Probabilistic Adaptive Metrics
Räsänen, O. J., & Blandón, M. A. C. (2020) · Interspeech (USB) · doi:10.21437/interspeech.2020-1738 · Cited by 33
Speeding up subgroup cryptosystems
Stam, M. (2003) · TU/e Research Portal · doi:10.6100/ir564670 · Cited by 33
Universal Filtering Via Prediction
Weissman, T., Ordentlich, E., Weinberger, M. J., Somekh-Baruch, A., & Merhav, N. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.892782 · Cited by 33
Grammar-compressed indexes with logarithmic search time
Claude, F., Navarro, G., & Pacheco, A. (2020) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2020.12.001 · Cited by 33
The Smallest Grammar Problem Revisited
Hucke, D., Lohrey, M., & Reh, C. P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46049-9_4 · Cited by 33
On the Bit-Complexity of Lempel--Ziv Compression
Ferragina, P., Nitto, I., & Venturini, R. (2013) · SIAM Journal on Computing · doi:10.1137/120869511 · Cited by 33
Approximate string matching on Ziv–Lempel compressed text
Kärkkäinen, J., Navarro, G., & Ukkonen, E. (2003) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00032-7 · Cited by 33
On Dictionary Adaptation for Recurrent Pattern Image Coding
Rodrigues, N. M. M., da Silva, E. A. B., Carvalho, M. B. D., de Faria, S. M. M., & da Silva, V. M. M. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2001392 · Cited by 33
Optimal In-Place Suffix Sorting
Li, Z., Li, J., & Huo, H. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-00479-8_22 · Cited by 33
Dynamic Location Management for Mobile Computing
Subrata, R., & Zomaya, A. Y. (2003) · Telecommunication Systems · doi:10.1023/a:1023443004805 · Cited by 33
A parallel architecture for high-speed data compression
Storer, J. A., & Reif, J. H. (1991) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(91)90091-m · Cited by 33
Reversible interframe compression of medical images: a comparison of decorrelation methods
Roos, P., & Viergever, M. A. (1991) · IEEE Transactions on Medical Imaging · doi:10.1109/42.108588 · Cited by 33
Complexity analysis of riverflow time series
Sen, A. K. (2008) · Stochastic Environmental Research and Risk Assessment · doi:10.1007/s00477-008-0222-x · Cited by 32
Natural scene statistics mediate the perception of image complexity
Gauvrit, N., Toscano, F. S., & Zenil, H. (2014) · Visual Cognition · doi:10.1080/13506285.2014.950365 · Cited by 32
DecMac: A Deep Context Model for High Efficiency Arithmetic Coding
Liu, Q., Xu, Y., & Li, Z. (2019) · International Conference on Artificial Intelligence in Information and Communication (ICAIIC) · doi:10.1109/icaiic.2019.8668843 · Cited by 32
Mining novelty-seeking trait across heterogeneous domains
Zhang, F., Yuan, N. J., Lian, D., & Xie, X. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2566486.2567976 · Cited by 32
Tuple-oriented Compression for Large-scale Mini-batch Stochastic Gradient Descent
Li, F., Chen, L., Zeng, Y., Kumar, A., Wu, X., Naughton, J. F., & Patel, J. M. (2019) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3299869.3300070 · Cited by 32
Liu, Z., Venkatesh, S. S., & Maley, C. C. (2008) · BMC Genomics · doi:10.1186/1471-2164-9-509 · Cited by 32
Misra, A., Roy, A., & Das, S. K. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354502 · Cited by 32
Seroussi, G. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860437 · Cited by 32
Ward, D. J. (2001) · Cited by 32
Learning to Control a Smart Home Environment
Cook, D. J., Huber, M., Gopalratnam, K., & Youngblood, G. M. (2003) · Cited by 32
Bitstream compression techniques for Virtex 4 FPGAs
Stefan, R. A., & Cotöfană, S. (2008) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.1109/fpl.2008.4629952 · Cited by 32
A Space-Optimal Grammar Compression
Takabatake, Y., Tomohiro, I., & Sakamoto, H. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2017.67 · Cited by 32
Metric Mean Dimension and Analog Compression
Gutman, Y., & Śpiewak, A. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2992388 · Cited by 32
Rate-distortion via Markov chain Monte Carlo
Jalali, S., & Weissman, T. (2008) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2008.4595107 · Cited by 32
An Overview of Custom Array Sequencing
Kothiyal, P., Cox, S. W., Ebert, J., Aronow, B. J., Greinwald, J. H., & Rehm, H. L. (2009) · Current Protocols in Human Genetics · doi:10.1002/0471142905.hg0717s61 · Cited by 31
Lee, S.-J., Cho, G.-Y., Ikeno, F., & Lee, T.-R. (2018) · Applied Sciences · doi:10.3390/app8091471 · Cited by 31
Unique Reconstruction of Coded Sequences from Multiset Substring Spectra
Gabrys, R., & Milenković, O. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437909 · Cited by 31
Multi-metric evaluations of acute psychedelic effects on fMRI brain entropy
McCulloch, D. E.-W., Olsen, A. S., Ozenne, B., Larsen, K. O., Stenbæk, D. S., Armand, S., Madsen, M. K., Knudsen, G. M., & Fisher, P. M. (2026) · Nature Communications · doi:10.1038/s41467-026-74215-5 · Cited by 31
Hansel, G., Perrin, D., & Simon, I. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55210-3_209 · Cited by 31
Phase transitions in tumor growth: III vascular and metastasis behavior
Llanos-Pérez, J. A., Betancourt-Mar, J. A., Cocho, G., Mansilla, R., & Nieto-Villar, J. M. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.06.086 · Cited by 31
A Hardware Architecture for Elliptic Curve Cryptography and Lossless Data Compression
Morales‐Sandoval, M., & Feregrino-Uribe, C. (2005) · International Conference on Electronics, Communications, and Computers · doi:10.1109/coniel.2005.8 · Cited by 31
Linguistic structure as composition and perturbation
de Marcken, C. (1996) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981863.981907 · Cited by 31
Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts
Yamamoto, T., Bannai, H., Inenaga, S., & Takeda, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21458-5_27 · Cited by 31
Toward cell outage detection with composite hypothesis testing
Liao, Q., Wiczanowski, M., & Stańczak, S. (2012) · International Conference on Communications · doi:10.1109/icc.2012.6364384 · Cited by 31
Mobility prediction using future knowledge
Sun, M. H., & Blough, D. M. (2007) · ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM) · doi:10.1145/1298126.1298167 · Cited by 31
A Compression Technique Based on Optimality of LZW Code (OLZW)
Nandi, U., & Mandal, J. K. (2012) · International Conference on Computer and Communication Technology · doi:10.1109/iccct.2012.40 · Cited by 31
Algorithmic Information Theory-Based Analysis of Earth Observation Images: An Assessment
Cerra, D., Mallet, A., Gueguen, L., & Datcu, M. (2009) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2009.2020349 · Cited by 31
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
Fischer, J., Tomohiro, I., Köppl, D., & Sadakane, K. (2017) · Algorithmica · doi:10.1007/s00453-017-0333-1 · Cited by 31
Window Subsequence Problems for Compressed Texts
Cégielski, P., Guessarian, I., Lifshits, Y., & Matiyasevich, Y. (2006) · Lecture notes in computer science · doi:10.1007/11753728_15 · Cited by 31
Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts
Klein, S. T. (2000) · Information Retrieval · doi:10.1023/a:1009910017828 · Cited by 31
Regular expression searching on compressed text
Navarro, G. (2003) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00036-4 · Cited by 31
Electrocardiographic signal compression using multiscale recurrent patterns
Filho, E. B. D. L., da Silva, E. A. B., Carvalho, M. B. D., Junior, W. S. D. S., & Koiller, J. (2005) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2005.857873 · Cited by 31
Fingerprints in compressed strings
Bille, P., Gørtz, I. L., Cording, P. H., Sach, B., Vildhøj, H. W., & Vind, S. (2017) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2017.01.002 · Cited by 30
Katerndahl, D. A., Burge, S. K., Ferrer, R. L., Becho, J., & Wood, R. G. (2014) · Journal of Evaluation in Clinical Practice · doi:10.1111/jep.12151 · Cited by 30
Entropy and Complexity Tools Across Scales in Neuroscience: A Review
Cofré, R., & Destexhe, A. (2025) · Entropy · doi:10.3390/e27020115 · Cited by 30
Helioseismology with Solar Orbiter
Löptien, B., Birch, A. C., Gizon, L., Schou, J., Appourchaux, T. P., Rodríguez, J. B., Cally, P. S., Domínguez-Tagle, C., Gandorfer, A. M., Hill, F., et al. (2014) · Space Science Reviews · doi:10.1007/s11214-014-0065-3 · Cited by 30
Universal Zero-Delay Joint Source–Channel Coding
Matloub, S., & Weissman, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885537 · Cited by 30
Li, D., Vlisides, P. E., & Mashour, G. A. (2022) · NeuroImage · doi:10.1016/j.neuroimage.2022.118891 · Cited by 30
A survey on predicting personal mobility
Burbey, I., & Martin, T. L. (2012) · International Journal of Pervasive Computing and Communications · doi:10.1108/17427371211221063 · Cited by 30
Weissman, T., Merhav, N., & Somekh-Baruch, A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930923 · Cited by 30
Sensor Network Provenance Compression Using Dynamic Bayesian Networks
Wang, C., & Bertino, E. (2017) · ACM Transactions on Sensor Networks · doi:10.1145/2997653 · Cited by 30
Flickering Emergences: The Question of Locality in Information-Theoretic Approaches to Emergence
Varley, T. F. (2022) · Entropy · doi:10.3390/e25010054 · Cited by 30
Computing the Longest Previous Factor
Crochemore, M., Ilie, L., Iliopoulos, C. S., Kubica, M., Rytter, W., & Waleń, T. (2012) · European Journal of Combinatorics · doi:10.1016/j.ejc.2012.07.011 · Cited by 30
Finite-Memory Universal Prediction of Individual Sequences
Meron, E., & Feder, M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.830749 · Cited by 30
Identification of data, devices, documents and individuals
Simmons, G. J. (2002) · IEEE International Carnahan Conference on Security Technology (ICCST) · doi:10.1109/ccst.1991.202215 · Cited by 30
A Comparison of Set Redundancy Compression Techniques
Ait-Aoudia, S., & Gabis, A. (2006) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/asp/2006/92734 · Cited by 30
Who wrote the "Letter to the Hebrews"?: data mining for detection of text authorship
Sabordo, M. G., Chai, S. Y., Berryman, M. J., & Abbott, D. (2005) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.582098 · Cited by 30
On locally decodable source coding
Makhdoumi, A., Huang, S., Médard, M., & Polyanskiy, Y. (2015) · International Conference on Communications · doi:10.1109/icc.2015.7249014 · Cited by 30
The Lempel-Ziv-Welch (LZW) data compression algorithm for packet radio
Kinsner, W., & Greenfield, R. (2002) · IEEE WESCANEX Communications, Power and Computing Conference (WESCANEX) · doi:10.1109/wescan.1991.160551 · Cited by 30
Balancing and clustering of words in the Burrows–Wheeler transform
Restivo, A., & Rosone, G. (2010) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.11.040 · Cited by 30
Cho, G.-Y., Lee, S.-J., & Lee, T.-R. (2014) · Journal of Medical Systems · doi:10.1007/s10916-014-0161-7 · Cited by 30
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
Jansson, J., Sadakane, K., & Sung, W.-K. K. (2013) · Algorithmica · doi:10.1007/s00453-013-9836-6 · Cited by 30
Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics
Merhav, N. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2266657 · Cited by 30
Improving network efficiency in real-time groupware with general message compression
Gutwin, C. A., Fedak, C., Watson, M., Dyck, J., & Bell, T. (2006) · ACM Conference on Computer Supported Cooperative Work (CSCW) · doi:10.1145/1180875.1180894 · Cited by 30
On the Wyner-Ziv problem for individual sequences
Merhav, N., & Ziv, J. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864434 · Cited by 30
Self-citationA Linear Algorithm for Data Compression.
Brent, R. P. (1987) · Australian Computer Journal · Cited by 30
Split-stream dictionary program compression
Lucco, S. E. (2000) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/349299.349307 · Cited by 30
Fauré, P., Neumeister, H., Faber, D. S., & Korn, H. (2003) · Fractals · doi:10.1142/s0218348x03002166 · Cited by 29
Inferring neuronal network functional connectivity with directed information
Cai, Z., Neveu, C. L., Baxter, D. A., Byrne, J. H., & Aazhang, B. (2017) · Journal of Neurophysiology · doi:10.1152/jn.00086.2017 · Cited by 29
Complex Systems, Emergence, and Multiscale Analysis: A Tutorial and Brief Survey
Gao, J., & Xu, B. (2021) · Applied Sciences · doi:10.3390/app11125736 · Cited by 29
Hybrid neural–cognitive models reveal how memory shapes human reward learning
Eckstein, M. K., Summerfield, C., Daw, N. D., & Miller, K. J. (2026) · Nature Human Behaviour · doi:10.1038/s41562-025-02324-0 · Cited by 29
Detection of rogue devices in wireless networks
Hall, J. (2006) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2006-06353 · Cited by 29
Ghosh, P., & Das, S. K. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2009.05.003 · Cited by 29
Roy, A., Misra, A., & Das, S. K. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1059 · Cited by 29
Performance Evaluation of LZ-Based Location Prediction Algorithms in Cellular Networks
Rodríguez-Carrión, A., García-Rubio, C., & Campo, C. (2010) · IEEE Communications Letters · doi:10.1109/lcomm.2010.08.092033 · Cited by 29
Peng, Z., Genewein, T., & Braun, D. A. (2014) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2014.00168 · Cited by 29
Provenance for Wireless Sensor Networks: A Survey
Wang, C., Zheng, W., & Bertino, E. (2016) · Data Science and Engineering · doi:10.1007/s41019-016-0017-x · Cited by 29
Measuring spike pattern reliability with the Lempel–Ziv-distance
Christen, M., Kohn, A., Ott, T., & Stoop, R. (2006) · Journal of Neuroscience Methods · doi:10.1016/j.jneumeth.2006.02.023 · Cited by 29
Entropy as a Measure of Log Variability
Back, C. O., Debois, S., & Slaats, T. (2019) · Journal on Data Semantics · doi:10.1007/s13740-019-00105-3 · Cited by 29
Mobility prediction in mobile ad hoc networks using a lightweight genetic algorithm
Suraj, R., Tapaswi, S., Yousef, S., Pattanaik, K. K., & Cole, M. (2015) · Wireless Networks · doi:10.1007/s11276-015-1059-0 · Cited by 29
Approximate pattern matching in LZ77-compressed texts
Gagie, T., Gawrychowski, P., & Puglisi, S. J. (2014) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2014.10.003 · Cited by 29
Energy efficient canonical huffman encoding
Matai, J., Kim, J.-Y., & Kastner, R. (2014) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap.2014.6868663 · Cited by 29
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
Tomohiro, I., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.03.005 · Cited by 29
An optimal text compression algorithm based on frequent pattern mining
Oswald, C., & Sivaselvan, B. (2017) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-017-0540-2 · Cited by 29
Benchmarking Open-Source Static 3D Mesh Codecs for Immersive Media Interactive Live Streaming
Doumanoglou, A., Drakoulis, P., Zioulis, N., Zarpalas, D., & Daras, P. (2019) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2019.2898768 · Cited by 29
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.