Papers
Topics
Authors
Recent
Search
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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.