IEEE
Mountain Snow Image

2006 IEEE International Symposium
on Information Theory

Sunday, July 9 -Friday, July 14, 2006
The Westin Seattle • Seattle, Washington

Paper Detail

Session:1.1.6 - Entropy
Session Time:Monday, July 10, 09:40 - 11:00
Paper Time:Monday, July 10, 10:00 - 10:20
Title: Analyticity of Entropy Rate in Families of Hidden Markov Chains (II)
Authors: Guangyue Han; University of British Columbia 
 Brian Marcus; University of British Columbia 
Abstract: We give relaxed sufficient conditions (compared to [2]) for analyticity of the entropy rate of a hidden Markov chain. Several special cases of the relaxed conditions are discussed. A general principle to calculate the domain of analyticity is stated. An example is given to estimate the radius of convergence for the entropy rate. Finally, we prove a ``stabilizing'' property of ``Black Hole'' case, which suggests that one can explicitly compute the derivatives and obtain an explicit Taylor series in certain cases, generalizing the results in [13], [12].



©2010 Conference Management Services, Inc. -||- email: webmaster@isit2006.org -||- Last updated Monday, November 19, 2007