The entropy of a binary Hidden Markov Process

Or Zuk; Ido Kanter; Eytan Domany

doi:10.1007/s10955-005-7576-y

The entropy of a binary Hidden Markov Process

Or Zuk, Ido Kanter, Eytan Domany

Department of Physics

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

30 Scopus citations

Abstract

The entropy of a binary symmetric Hidden Markov Process is calculated as an expansion in the noise parameter ε. 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 ε. Using a conjecture we extend the calculation to 11th order and discuss the convergence of the resulting series.

Original language	English
Pages (from-to)	343-360
Number of pages	18
Journal	Journal of Statistical Physics
Volume	121
Issue number	3-4
DOIs	https://doi.org/10.1007/s10955-005-7576-y
State	Published - Sep 2005

Bibliographical note

Funding Information:
I.K. thanks N. Merhav for very helpful comments, and the Einstein Center for Theoretical Physics for partial support. This work was partially supported by grants from the Minerva Foundation and by the European Community’s Human Potential Programme under Contract HPRN-CT-2002-00319, STIPCO.

Funding

I.K. thanks N. Merhav for very helpful comments, and the Einstein Center for Theoretical Physics for partial support. This work was partially supported by grants from the Minerva Foundation and by the European Community’s Human Potential Programme under Contract HPRN-CT-2002-00319, STIPCO.

Funders	Funder number
European Community’s Human Potential Programme	HPRN-CT-2002-00319
Minerva Foundation

Keywords

Entropy
Hidden Markov Process
Random-field Ising model

Access to Document

10.1007/s10955-005-7576-y

Cite this

@article{267f105b1b954234b6cbac623bed944a,

title = "The entropy of a binary Hidden Markov Process",

abstract = "The entropy of a binary symmetric Hidden Markov Process is calculated as an expansion in the noise parameter ε. 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 ε. Using a conjecture we extend the calculation to 11th order and discuss the convergence of the resulting series.",

keywords = "Entropy, Hidden Markov Process, Random-field Ising model",

author = "Or Zuk and Ido Kanter and Eytan Domany",

note = "Funding Information: I.K. thanks N. Merhav for very helpful comments, and the Einstein Center for Theoretical Physics for partial support. This work was partially supported by grants from the Minerva Foundation and by the European Community{\textquoteright}s Human Potential Programme under Contract HPRN-CT-2002-00319, STIPCO.",

year = "2005",

month = sep,

doi = "10.1007/s10955-005-7576-y",

language = "אנגלית",

volume = "121",

pages = "343--360",

journal = "Journal of Statistical Physics",

issn = "0022-4715",

publisher = "Springer New York",

number = "3-4",

}

TY - JOUR

T1 - The entropy of a binary Hidden Markov Process

AU - Zuk, Or

AU - Kanter, Ido

AU - Domany, Eytan

N1 - Funding Information: I.K. thanks N. Merhav for very helpful comments, and the Einstein Center for Theoretical Physics for partial support. This work was partially supported by grants from the Minerva Foundation and by the European Community’s Human Potential Programme under Contract HPRN-CT-2002-00319, STIPCO.

PY - 2005/9

Y1 - 2005/9

N2 - The entropy of a binary symmetric Hidden Markov Process is calculated as an expansion in the noise parameter ε. 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 ε. Using a conjecture we extend the calculation to 11th order and discuss the convergence of the resulting series.

AB - The entropy of a binary symmetric Hidden Markov Process is calculated as an expansion in the noise parameter ε. 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 ε. Using a conjecture we extend the calculation to 11th order and discuss the convergence of the resulting series.

KW - Entropy

KW - Hidden Markov Process

KW - Random-field Ising model

UR - http://www.scopus.com/inward/record.url?scp=28644448733&partnerID=8YFLogxK

U2 - 10.1007/s10955-005-7576-y

DO - 10.1007/s10955-005-7576-y

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:28644448733

SN - 0022-4715

VL - 121

SP - 343

EP - 360

JO - Journal of Statistical Physics

JF - Journal of Statistical Physics

IS - 3-4

ER -

The entropy of a binary Hidden Markov Process

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this