File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Analyticity of entropy rate in families of hidden Markov chains (II)

TitleAnalyticity of entropy rate in families of hidden Markov chains (II)
Authors
Han, GMarcus, B
Issue Date2006
Citation
Ieee International Symposium On Information Theory - Proceedings, 2006, p. 103-107 How to Cite?
DOI: http://dx.doi.org/10.1109/ISIT.2006.261683
AbstractWe give relaxed sufficient conditions (compared to [2]) for analyticky 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]. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158865
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorHan, Gen_US
dc.contributor.authorMarcus, Ben_US
dc.date.accessioned2012-08-08T09:03:59Z-
dc.date.available2012-08-08T09:03:59Z-
dc.date.issued2006en_US
dc.identifier.citationIeee International Symposium On Information Theory - Proceedings, 2006, p. 103-107en_US
dc.identifier.urihttp://hdl.handle.net/10722/158865-
dc.description.abstractWe give relaxed sufficient conditions (compared to [2]) for analyticky 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]. © 2006 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEE International Symposium on Information Theory - Proceedingsen_US
dc.titleAnalyticity of entropy rate in families of hidden Markov chains (II)en_US
dc.typeConference_Paperen_US
dc.identifier.emailHan, G:ghan@hku.hken_US
dc.identifier.authorityHan, G=rp00702en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/ISIT.2006.261683en_US
dc.identifier.scopuseid_2-s2.0-39049095208en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-39049095208&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage103en_US
dc.identifier.epage107en_US
dc.identifier.scopusauthoridHan, G=8640067800en_US
dc.identifier.scopusauthoridMarcus, B=7102086378en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats