2000 character limit reached
Entropy Rate for Hidden Markov Chains with rare transitions
Published 9 Dec 2010 in cs.IT, math.IT, and math.PR | (1012.2086v1)
Abstract: We consider Hidden Markov Chains obtained by passing a Markov Chain with rare transitions through a noisy memoryless channel. We obtain asymptotic estimates for the entropy of the resulting Hidden Markov Chain as the transition rate is reduced to zero.
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.
