• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Entropy rate for hidden Markov chains with rare transitions,” arXiv preprint arXiv:1012.2086 (2010)

by Y Peres, A Quas
Add To MetaCart

Tools

Sorted by:
Results 1 - 4 of 4

Analyticity of entropy rate of a hidden Markov chain

by Guangyue Han, Brian Marcus - In Proc. of IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-September 9 2005 , 1995
"... We prove that under mild positivity assumptions the entropy rate of a hidden Markov chain varies analytically as a function of the underlying Markov chain parameters. A general principle to determine the domain of analyticity is stated. An example is given to estimate the radius of convergence for t ..."
Abstract - Cited by 31 (13 self) - Add to MetaCart
We prove that under mild positivity assumptions the entropy rate of a hidden Markov chain varies analytically as a function of the underlying Markov chain parameters. A general principle to determine the domain of analyticity is stated. An example is given to estimate the radius of convergence for the entropy rate. We then show that the positivity assumptions can be relaxed, and examples are given for the relaxed conditions. We study a special class of hidden Markov chains in more detail: binary hidden Markov chains with an unambiguous symbol, and we give necessary and sufficient conditions for analyticity of the entropy rate for this case. Finally, we show that under the positivity assumptions the hidden Markov chain itself varies analytically, in a strong sense, as a function of the underlying Markov chain parameters. 1
(Show Context)

Citation Context

...g-likelihhod vary together. In contrast, in [19], the expectation is taken with respect to a fixed parameter value. Given the interest in the analyticity results [4] for the discrete-alphabet setting =-=[8, 13, 15, 16, 19, 20]-=-, we expect that the results in this paper will be of significance for the continuousalphabet setting as well. The remainder of this paper is organized as follows. In Section 2, we review the (real) H...

1 On the Performance of Short Block Codes over Finite-State Channels in the Rare-Transition Regime

by Fatemeh Hamidi-sepehr, Jean-francois Chamberl, Henry D. Pfister , 2014
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

A Randomized Approach to the Capacity of Finite-State Channels

by Guangyue Han , 2013
"... ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...-state channels. However, some of the basic problems, such as smoothness (or even differentiability) of H(Y ), have long remained unknown. Recently, asymptotical behavior of H(Y ) has been studied in =-=[3, 29, 39, 40, 56, 57, 38, 41, 44]-=-. Particularly in [56], for a special type of hidden Markov chain Y , the Taylor series expansion of H(Y ) is given under the assumption that H(Y ) is analytic. Under mild assumptions, analyticity of ...

Compensation Functions for Shifts of Finite Type and a Phase Transition in the p-Dini Functions

by John Antonioli, John Antonioli
"... ii ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...µ on the inputs which could gave rise to ν. The two distributions may differ because information may be lost in the transmission. For examples of papers where this point of view is taken see [11] and =-=[13]-=-. Here, one role filled by thermodynamic formalism is to identify those measures µ which have maximal entropy given that they produced the observed output distribution ν. The entropy of µ then gives t...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University