Universal coding, information, prediction, and estimation
The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
A connection between universal codes and the problems of prediction and statistical estimation is established. A known lower bound for the mean length of universal codes is sharpened and generalized, and optimum universal codes constructed. The bound is defined to give the information in strings relative to the considered class of processes. The earlier derived minimum description length criterion for estimation of parameters, including their number, is given a fundamental information, theoretic justification by showing that its estimators achieve the information in the strings. It is also shown that one cannot do prediction in Gaussian autoregressive moving average (ARMA) processes below a bound, which is determined by the information in the data.
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
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Self-citationA Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,672
Self-citationUniversal codeword sets and representations of the integers
Elias, P. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055349 · Cited by 1,165
The Theory of Information and Coding
McEliece, R. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511606267 · Cited by 986
A universal data compression system
Rissanen, J. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056741 · Cited by 631
Self-citationShibata, R. (1980) · The Annals of Statistics · doi:10.1214/aos/1176344897 · Cited by 542
The performance of universal encoding
Krichevsky, R., & Trofimov, V. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056331 · Cited by 535
The Estimation of the Order of an ARMA Process
Hannan, E. J. (1980) · The Annals of Statistics · doi:10.1214/aos/1176345144 · Cited by 489
Rissanen, J., & Langdon, G. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056282 · Cited by 454
Self-citationDavisson, L. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055092 · Cited by 365
The prediction error of stationary Gaussian time series of unknown covariance
Davisson, L. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053829 · Cited by 73
Minimax noiseless universal coding for Markov sources
Davisson, L. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056652 · Cited by 65
Cited by
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
The Minimum Description Length Principle
Grünwald, P. D. (2007) · doi:10.7551/mitpress/4643.001.0001 · Cited by 1,644
The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
Weinberger, M. J., Seroussi, G., & Sapiro, G. (2000) · IEEE Transactions on Image Processing · doi:10.1109/83.855427 · Cited by 1,638
Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard
Marpe, D., Schwarz, H., & Wiegand, T. (2003) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2003.815173 · Cited by 1,219
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Metadata
- Authors
- Rissanen, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1984-07
- Volume
- 30
- Issue
- 4
- Pages
- 629-636
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2132119275
- Cited by
- 898
- References
- 13
- FWCI
- 4.66
- 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.