Entropy estimation of symbol sequences
<|reference_start|>Entropy estimation of symbol sequences: We discuss algorithms for estimating the Shannon entropy h of finite symbol sequences with long range correlations. In particular, we consider algorithms which estimate h from the code lengths produced by some compression algorithm. Our interest is in describing their convergence with sequence length, assuming no limits for the space and time complexities of the compression algorithms. A scaling law is proposed for extrapolation from finite sample lengths. This is applied to sequences of dynamical systems in non-trivial chaotic regimes, a 1-D cellular automaton, and to written English texts.<|reference_end|>
@article{schürmann2002entropy,
    title={Entropy estimation of symbol sequences},
    author={Thomas Sch"urmann and Peter Grassberger},
    journal={CHAOS Vol. 6, No. 3 (1996) 414-427},
    year={2002},
    doi={10.1063/1.166191},
    archivePrefix={arXiv},
    eprint={cond-mat/0203436},
    primaryClass={cond-mat.stat-mech cs.CL cs.IT math.IT physics.data-an stat.ML}
}