The Structure of the I-Measure of a Markov Chain

IEEE Transactions on Information Theory

Volumn 38, Issue 3, 1992, Pages 1146-1149

  Yeung, Raymond W ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

I Diagram; I Measure; Markov Chain; Shannon's information measures

Indexed keywords

PROBABILITY - RANDOM PROCESSES;

INFORMATION MEASURES; MARKOV CHAINS;

INFORMATION THEORY;

EID: 0026866128     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.135658     Document Type: Article

References (10)

1. R. W. Yeung, “A new outlook on Shannon’s information measures,” IEEE Trans. Inform. Theory, vol. 37, pp. 466–474, May 1991.
2. F. M. Reza, An Introduction to Information Theory. New York: McGraw Hill, 1961.
3. N. M. Abramson, Information Theory and Coding. New York: McGraw-Hill, 1963.
4. H. G. Ding, “On the amount of information,” (in Russian) Teor. Veroyatnost. i Primenen. vol. 4, pp. 447–455, 1962.
5. L. L. Campbell, “Entropy as a measure,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 112–114, Jan. 1965.
6. T. S. Han, “Nonnegative entropy measures of multivariate symmetric correlations,” Inform. Contr., vol. 36, pp. 133–156, 1978.
7. T. Kawabata, “Gaussian multiterminal source coding,” Master the-sis, Math. Eng., Univ. of Toyko, Japan, Feb. 1980.
8. I. Csiszar and J. Komer, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press; Budapest: Akademiai Kiado, 1981.
9. A. Papoulis, Probability, Random Variables and Stochastic Processes, 2nd ed. New York: McGraw Hill, 1984.
10. H. L. Dyckman, private communication.