The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A universal data compression system
Abstract
A universal data compression algorithm is described which is capable of compressing long strings generated by a "finitely generated" source, with a near optimum per symbol length without prior knowledge of the source. This class of sources may be viewed as a generalization of Markov sources to random fields. Moreover, the algorithm does not require a working storage much larger than that needed to describe the source generating parameters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Self-citationCompression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
On entropy maximization principle
Akaike, H. (1977) · Medical Entomology and Zoology · Cited by 634
Rissanen, J., & Langdon, G. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056282 · Cited by 454
Self-citationKrishnaiah, P. R. (1978) · Biometrics · doi:10.2307/2530627 · Cited by 312
Cited by
The minimum description length principle in coding and modeling
Barron, A., Rissanen, J., & Yu, B. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720554 · Cited by 1,019
Self-citationMicrobial gene identification using interpolated Markov models
Salzberg, S. L., Delcher, A. L., Kasif, S., & White, O. (1998) · Nucleic Acids Research · doi:10.1093/nar/26.2.544 · Cited by 996
The context-tree weighting method: basic properties
Willems, F. M. J., Shtarkov, Y. M., & Tjalkens, T. J. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382012 · Cited by 919
Universal coding, information, prediction, and estimation
Rissanen, J. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056936 · Cited by 898
Self-citationEstimation and Inference by Compact Coding
Wallace, C. S., & Freeman, P. R. (1987) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1987.tb01695.x · Cited by 523
Computational Mechanics: Pattern and Prediction, Structure and Simplicity
Shalizi, C. R., & Crutchfield, J. P. (2001) · Journal of Statistical Physics · doi:10.1023/a:1010388907793 · Cited by 471
The power of amnesia: Learning probabilistic automata with variable memory length
Ron, D., Singer, Y., & Tishby, N. (1997) · Machine Learning · doi:10.1007/bf00114008 · Cited by 447
Optimal pruning with applications to tree-structured source coding and modeling
Chou, P. A., Lookabaugh, T., & Gray, R. M. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.32124 · Cited by 407
Bühlmann, P., & Wyner, A. J. (1999) · The Annals of Statistics · doi:10.1214/aos/1018031204 · Cited by 394
Lelewer, D. A., & Hirschberg, D. S. (1987) · ACM Computing Surveys · doi:10.1145/45072.45074 · Cited by 377
Universal prediction of individual sequences
Feder, M., Merhav, N., & Gutman, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144706 · Cited by 373
Universal portfolios with side information
Cover, T. M., & Ordentlich, E. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485708 · Cited by 347
Entropy estimation of symbol sequences
Schürmann, T., & Grassberger, P. (1996) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.166191 · Cited by 319
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
Bhattacharya, A., & Das, S. K. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313457 · Cited by 307
Jayasankar, U., Thirumal, V., & Ponnurangam, D. (2021) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2018.05.006 · Cited by 279
Bühlmann, P. (2002) · Statistical Science · doi:10.1214/ss/1023798998 · Cited by 265
Bell, T., Witten, I. H., & Cleary, J. G. (1989) · ACM Computing Surveys · doi:10.1145/76894.76896 · Cited by 261
LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
Bhattacharya, A., & Das, S. K. (2002) · Wireless Networks · doi:10.1023/a:1013759724438 · Cited by 205
“Consequently, we need to formalize the notion of uncertainty we have been talking about since the beginning.”
BackgroundInvestigating purchasing-sequence patterns for financial services using Markov, MTD and MTDg models
Prinzie, A., & Van den Poel, D. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.05.004 · Cited by 75
Metadata
- Authors
- Rissanen, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1983-09
- Volume
- 29
- Issue
- 5
- Pages
- 656-664
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2082967074
- Cited by
- 631
- References
- 5
- FWCI
- 2.65
- Type
- journal article
- Language
- en
- Open access
- closed
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.