Entropy and prefixes

DOI10.1214/aop/1176989934zbMath0765.28016OpenAlexW2093428076MaRDI QIDQ1184096

Paul C. Shields

Publication date: 28 June 1992

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176989934

zbMATH Keywords

entropyMarkov processHausdorff dimensionsymbolic dynamical systemsBernoulli processesentropy-zero process

Mathematics Subject Classification ID

Strong limit theorems (60F15) Entropy and other invariants (28D20) Measures of information, entropy (94A17) One-parameter continuous families of measure-preserving transformations (28D10)

Related Items

Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach ⋮ Entropy estimation of symbol sequences ⋮ String matching bounds via coding ⋮ BIAS REDUCTION OF THE NEAREST NEIGHBOR ENTROPY ESTIMATOR ⋮ Statistical estimation of measure invariants ⋮ Waiting times: Positive and negative results on the Wyner-Ziv problem ⋮ Two divergence-rate counterexamples ⋮ Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter ⋮ Selection of a metric for the nearest neighbor entropy estimators ⋮ Uncommon suffix tries ⋮ Non-parametric change-point estimation using string matching algorithms ⋮ A Central Limit Theorem for Non-Overlapping Return Times ⋮ More on recurrence and waiting times

This page was built for publication: Entropy and prefixes