2000 character limit reached
Entropy of random symbolic high-order bilinear Markov chains
Published 18 Sep 2017 in cond-mat.stat-mech and physics.data-an | (1709.06642v1)
Abstract: The main goal of this paper is to develop an estimate for the entropy of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We present here the detailed analytical study of the entropy for the high-order Markov chain in the bilinear approximation. The appendix contains a short comprehensive introduction into the subject of study.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.