The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
The context-tree weighting method: basic properties
Open accessAbstract
Describes a sequential universal data compression procedure for binary tree sources that performs the "double mixture." Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and storage complexity of the proposed procedure are both linear in the source sequence length. The authors derive a natural upper bound on the cumulative redundancy of the method for individual sequences. The three terms in this bound can be identified as coding, parameter, and model redundancy, The bound holds for all source sequence lengths, not only for asymptotically large lengths. The analysis that leads to this bound is based on standard techniques and turns out to be extremely simple. The upper bound on the redundancy shows that the proposed context-tree weighting procedure is optimal in the sense that it achieves the Rissanen (1984) lower bound.>
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
Information 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 Coding.
Good, I. J., & Abramson, N. (1964) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343598 · Cited by 1,068
Universal coding, information, prediction, and estimation
Rissanen, J. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056936 · Cited by 898
STOCHASTIC COMPLEXITY IN STATISTICAL INQUIRY
Dawid, A. P. (1991) · Bulletin of the London Mathematical Society · doi:10.1112/blms/23.1.106 · Cited by 651
A universal data compression system
Rissanen, J. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056741 · Cited by 631
The performance of universal encoding
Krichevsky, R., & Trofimov, V. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056331 · Cited by 535
Generalized Kraft Inequality and Arithmetic Coding
Rissanen, J. J. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.203.0198 · Cited by 510
Cited by
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
FPGA Intrinsic PUFs and Their Use for IP Protection
Guajardo, J., Kumar, S. S., Schrijen, G.-J., & Tuyls, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_5 · Cited by 1,203
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
Compression via channel coding - Distributed source coding for sensor networks
Xiong, Z., Liveris, A. D., & Cheng, S. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1328091 · Cited by 739
Berger, T. (2003) · Wiley Encyclopedia of Telecommunications · doi:10.1002/0471219282.eot142 · Cited by 717
Information Theory and Statistics: A Tutorial
Csiszár, I., & Shields, P. C. (2004) · now publishers, Inc. eBooks · doi:10.1561/9781933019543 · Cited by 589
A First Course in Information Theory
Yeung, R. W. (2002) · Information Technology: Transmission, Processing and Storage · doi:10.1007/978-1-4419-8608-5 · Cited by 533
Physically Unclonable Functions: A Study on the State of the Art and Future Research Directions
Maes, R., & Verbauwhede, I. (2010) · Information Security and Cryptography · doi:10.1007/978-3-642-14452-3_1 · Cited by 469
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
Merhav, N., & Feder, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720534 · Cited by 438
Information Theory and Statistics: A Tutorial
Csiszár, I., & Shields, P. C. (2004) · Foundations and Trends™ in Communications and Information Theory · doi:10.1561/0100000004 · Cited by 420
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
Email Spam Filtering: A Systematic Review
Cormack, G. V. (2008) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000006 · Cited by 262
On Prediction Using Variable Order Markov Models
Begleiter, R., El-Yaniv, R., & Yona, G. (2004) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1491 · Cited by 258
Katzenbeisser, S., Kocabaş, Ü., Rožić, V., Sadeghi, A.-R., Verbauwhede, I., & Wachsmann, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_17 · Cited by 254
Metadata
- Authors
- Willems, F. M. J., Shtarkov, Y. M., & Tjalkens, T. J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1995-05
- Volume
- 41
- Issue
- 3
- Pages
- 653-664
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2163294786
- Cited by
- 919
- References
- 17
- FWCI
- 17.71
- Type
- journal article
- Language
- en
- Open access
- green
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.