Asymptotics of entropy rate of hidden Markov chains at weak Black Holes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 2629-2633

  Han, Guangyue ^a   Marcus, Brian ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC FORMULAE; ASYMPTOTICS; BLACK HOLE; BLACK HOLES; ENTROPY RATES; HIDDEN MARKOV CHAINS; INTERNATIONAL SYMPOSIUM;

ASYMPTOTIC ANALYSIS; CYBERNETICS; HIDDEN MARKOV MODELS; INFORMATION THEORY; SIGNAL THEORY; STARS; TECHNICAL PRESENTATIONS;

MARKOV PROCESSES;

EID: 52349102534     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595468     Document Type: Conference Paper

References (20)

1. D. Arnold and H. Loeliger. The information rate of binary-input channels with memory, Proc. 2001 IEEE Int. Conf. on Communications, (Helsinki, Finland), pp. 2692-2695, June 11-14 2001.
2. D. M. Arnold, H.-A. Loeliger, P. O. Vontobel, A. Kavcic, W. Zeng, "Simulation-Based Computation of Information Rates for Channels With Memory," IEEE Trans. Information Theory, 52, 3498-3508, 2006.
3. J. Birch. Approximations for the entropy for functions bf Markov chains. Ann. Math. Statist., 33:930-938, 1962.
4. D. Blackwell. The entropy of functions of finite-state Markov chains. Trans. First Prague Conf. Information Thoery, Statistical Decision Functions, Random Processes, pages 13-20, 1957.
5. S. Egner, V. Balakirsky, L. Tolhuizen, S. Baggen and H. Hollmann. On the entropy rate of a hidden Markov model. Proceedings of the 2004 IEEE International Symposium on Information Theory, page 12, June 27-July 2, Chicago, U.S.A., 2004.
6. R. Gharavi and V. Anantharam. An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices. Theoretical Computer Science, Vol. 332, Nos. 1-3, pp. 543-557, February 2005.
7. G. Han and B. Marcus. Analyticity of entropy rate of hidden Markov chains. IEEE Transactions on Information Theory, Volume 52, Issue 12, December, 2006, pages:5251-5266.
8. G. Han and B. Marcus. Derivatives of Entropy Rate in Special Families of Hidden Markov Chains. IEEE Transactions on Information Theory, Volume 53, Issue 7, July 2007, Page(s):2642-2652.
9. G. Han and B. Marcus. Asymptotics of noisy constrained capacity. Proc. ISIT 2007, Nice, June 24-June 29, 2007, Pages:991-995. The journal version of this paper with slightly different title was submitted to Annals of Applied Probability.
10. T. Holliday, A. Goldsmith and P. Glynn. Capacity of finite state markov channels with general inputs. Proceedings of the 2003 IEEE International Symposium on Information Theory, 29 June-4 July 2003, Page(s):289-289.
11. T. Holliday, A. Goldsmith, and P. Glynn. Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices. IEEE Transactions on Information Theory, Volume 52, Issue 8, Aug. 2006, Page(s):3509-3532.
12. P. Jacquet, G. Seroussi, and W. Szpankowski. On the Entropy of a Hidden Markov Process (extended abstract). Data Compression Conference, 362-371, Snowbird, 2004.
13. P. Jacquet, G. Seroussi, and W. Szpankowski. Noisy Constrained Capacity. International Symposium on Information Theory. 986-990, Nice, 2007.
14. E. Ordentlich and T. Weissman. On the optimality of symbol by symbol filtering and denoising. Information Theory, IEEE Transactions, Volume 52, Issue 1, Jan. 2006 Page(s):19-40.
15. E. Ordentlich and T. Weissman. New bounds on the entropy rate of hidden Markov process. IEEE Information Theory Workshop, San Antonio, Texas, 24-29 Oct. 2004, Page(s):117-122.
16. H. Pfister, J. Soriaga and P. Siegel. The achievable information rates of finite-state ISI channels. Proc. IEEE GLOBECOM, (San Antonio, TX), pp. 2992-2996, Nov. 2001.
17. E. Seneta. Springer Series in Statistics. Non-negative Matrices and Markov Chains. Springer-Verlag, New York Heidelberg Berlin, 1980.
18. V. Sharma and S. Singh. Entropy and channel capacity in the regenerative setup with applications to Markov channels. Proc. IEEE Intern. Symp. on Inform. Theory, (Washington, D.C.), p. 283, June 24-29 2001.
19. O. Zuk, I. Kanter and E. Domany. The entropy of a binary hidden Markov process. J. Stat. Phys., 121(3-4):343-360 (2005)
20. O. Zuk, E. Domany, I. Kanter, and M. Aizenman. From Finite-System Entropy to Entropy Rate for a Hidden Markov Process. Signal Processing Letters, IEEE, Volume 13, Issue 9, Sept. 2006 Page(s):517-520.