The Entropy of a Binary Hidden Markov Process
信息论
2009-11-11 v1 统计力学
math.IT
统计理论
统计理论
摘要
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.
引用
@article{arxiv.cs/0507060,
title = {The Entropy of a Binary Hidden Markov Process},
author = {O. Zuk and I. Kanter and E. Domany},
journal= {arXiv preprint arXiv:cs/0507060},
year = {2009}
}