The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The performance of universal encoding
Abstract
Universal coding theory is surveyed from the viewpoint of the interplay between delay and redundancy. The price for universality turns out to be acceptably small.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Universal 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
Cover, T. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1054929 · Cited by 504
Davisson, L. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055092 · Cited by 365
Two inequalities implied by unique decipherability
McMillan, B. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056818 · Cited by 203
Fixed rate universal block source coding with a fidelity criterion
Neuhoff, D. L., Gray, R. M., & Davisson, L. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055439 · Cited by 104
On variable-length-to-block coding
Jelinek, F., & Schneider, K. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054899 · Cited by 93
Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterion
Ziv, J. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054831 · Cited by 88
Coding of sources with unknown statistics--I: Probability of encoding error
Ziv, J. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054830 · Cited by 38
Cited by
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
Fisher information and stochastic complexity
Rissanen, J. J. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481776 · Cited by 814
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
On-Line Unsupervised Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms
Yamanishi, K., Takeuchi, J.-I., Williams, G., & Milne, P. (2004) · Data Mining and Knowledge Discovery · doi:10.1023/b:dami.0000023676.72185.7c · Cited by 476
Metadata
- Authors
- Krichevsky, R., & Trofimov, V.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1981-03
- Volume
- 27
- Issue
- 2
- Pages
- 199-207
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1999120268
- Cited by
- 535
- References
- 9
- FWCI
- 3.47
- 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.