The Entropy of a Binary Hidden Markov Process
<|reference_start|>The Entropy of a Binary Hidden Markov Process: 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.<|reference_end|>
@article{zuk2005the,
    title={The Entropy of a Binary Hidden Markov Process},
    author={O. Zuk, I. Kanter, E. Domany},
    journal={arXiv preprint arXiv:cs/0507060},
    year={2005},
    doi={10.1007/s10955-005-7576-y},
    archivePrefix={arXiv},
    eprint={cs/0507060},
    primaryClass={cs.IT cond-mat.stat-mech math.IT math.ST stat.TH}
}