The Entropy of a Binary Hidden Markov Process

Details The Entropy of a Binary Hidden Markov Process The Entropy of a Binary Hidden Markov Process

2005-07-23

arxiv.org/abs/cs/0507060v1

Computer Science

Information Theory

Scientific paper

10.1007/s10955-005-7576-y

The entropy of a binary symmetric Hidden Markov Process is calculated as an expansion in the noise parameter epsilon. We map the problem onto a one-dimensional Ising model in a large field of random signs and calculate the expansion coefficients up to second order in epsilon. Using a conjecture we extend the calculation to 11th order and discuss the convergence of the resulting series.

Affiliated with

Also associated with

No associations

Rating

The Entropy of a Binary Hidden Markov Process 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 The Entropy of a Binary Hidden Markov Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Entropy of a Binary Hidden Markov Process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-544516