New bounds on the entropy rate of hidden Markov processes

2004 IEEE Information Theory Workshop - Proceedings, ITW

Volumn , Issue , 2004, Pages 117-122

  Ordentlich, Erik ^a   Weissman, Tsachy ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; MARKOV PROCESSES; MATRIX ALGEBRA; MONTE CARLO METHODS; PROBABILITY; RANDOM PROCESSES;

BINARY SYMMETRIC CHANNELS (BDC); DISCRETE MEMORYLESS CHANNELS; ENTROPY RATE; HIDDEN MARKOV PROCESSES;

ENTROPY;

EID: 19544362681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. [Bir62] J. J. Birch. Approximations for the Entropy for Functions of Markov Chains Ann. Math. Stat., vol. 33, pp. 930-938, 1962.
2. [Bla57] D. Blackwell. The entropy of functions of finite-state markov chains. Trans. First Prague Conf. Inf. Th., Statistical Decision Functions, Random Processes, pages 13-20, 1957.
3. [CT91] T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, New York, 1991.
4. [EBTBH04] S. Egner, V. B. Balakirsky, L. M. G. M. Tolhuizen, S. P. M. J. Baggen, and H. D. L. Hollmann On the Entropy Rate of a Hidden Markov Model. Int. Symp. Inf. Th., p. 12, Chicago, IL, June-July 2004.
5. [EM02] Y. Ephraim and N. Merhav. Hidden Markov processes. IEEE Trans. Inform. Theory, vol. IT-48, no. 6, pp. 1518-1569, June 2002.
6. [HJ99] B. M. Hochwald and P. R. Jelenković. State Learning and Mixing in Entropy of Hidden Markov Processes and the Gilbert-Elliott Channel. IEEE Trans. Inform. Theory, vol. IT-45, no. 1, pp. 128-138, January 1999.
7. [HGG03] T. Holliday, P. Glynn, and A. Goldsmith. Capacity of Finite State Markov Channels with General Inputs. Int. Symp. Inf. Th., p. 289, Yokohama, Japan, June-July 2003.
8. [JSS04] P. Jacquet, G. Seroussi, and W. Szpankowski. On the Entropy of a Hidden Markov Process. Int. Symp. Inf. Th., p. 10, Chicago, IL, June-July 2004.
9. [MBD89] M. Mushkin and I. Bar-David. Capacity and Coding for the Gilbert-Elliot Channel. IEEE Trans. Inform. Theory, vol. IT-35, pp. 1277-1290, November 1989.
10. [OW04a] E. Ordentlich and T. Weissman. On the Optimally of Symbol by Symbol Fitering and Denoising. Submitted to IEEE Trans. Inform. Theory.
11. See also Int. Symp. Inf. Th., p. 200, Chicago, IL, June-July 2004.
12. [OW04b] E. Ordentlich and T. Weissman. First-Order Asymptotics for the Entropy Rate of Hidden Markov Processes. In preparation.
13. [ZKD04] O. Zuk, I. Kanter, and E. Domany. Asymptotics of the Entropy Rate for a Hidden Markov Process. Submitted to SSPIT, 2004.