Computer Science – Information Theory
Scientific paper
2010-12-09
Computer Science
Information Theory
To appear in Hidden Markov Processes by Marcus, Petersen and Weissman (eds); CUP
Scientific paper
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.
Peres Yuval
Quas Anthony
No associations
LandOfFree
Entropy Rate for Hidden Markov Chains with rare transitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Entropy Rate for Hidden Markov Chains with rare transitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entropy Rate for Hidden Markov Chains with rare transitions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-77660