Laplace's law of succession and universal encoding

DOI10.1109/18.651051zbMath1053.94534OpenAlexW2098397165MaRDI QIDQ4392458

Rafail E. Krichevsky

Publication date: 10 August 1998

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.651051

Mathematics Subject Classification ID

Information theory (general) (94A15)

Related Items (6)

On universal prediction and Bayesian confirmation ⋮ Bernstein polynomials and learning theory ⋮ A \(k\)-norm pruning algorithm for decision tree classifiers based on error rate estimation ⋮ Singularity analysis and asymptotics of Bernoulli sums ⋮ On an asymptotic series of Ramanujan ⋮ On asymptotically optimal methods of prediction and adaptive coding for Markov sources

This page was built for publication: Laplace's law of succession and universal encoding