2000 character limit reached
Infinite Excess Entropy Processes with Countable-State Generators
Published 14 Nov 2011 in cs.IT, cond-mat.stat-mech, math.IT, math.PR, and nlin.CD | (1111.3393v1)
Abstract: We present two examples of finite-alphabet, infinite excess entropy processes generated by invariant hidden Markov models (HMMs) with countable state sets. The first, simpler example is not ergodic, but the second is. It appears these are the first constructions of processes of this type. Previous examples of infinite excess entropy processes over finite alphabets admit only invariant HMM presentations with uncountable state sets.
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.