Some upper bounds for relative entropy and applications

Computers and Mathematics with Applications

Volumn 39, Issue 9, 2000, Pages 91-100

  Dragomir, S S ^a   Scholz, M L ^b   Sunde, J ^b  

^a VICTORIA UNIVERSITY   (Australia)

^b DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMAL MAPPING; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THEOREM PROVING;

DIAZ-METCALF INEQUALITY; KANTOROVIC INEQUALITY; LOG MAPPING; MUTUAL INFORMATION; RELATIVE ENTROPY;

BOUNDARY CONDITIONS;

EID: 0034209835     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(00)00089-4     Document Type: Article

References (9)

1. 1. T.M. Cover and J.A. Thomas, Elements of Information Theory, John Wiley & Sons, (1991).
2. 2. S.S. Dragomir and N.M. Dragomir, An inequality for logarithms and its application in coding theory, Indian Journal of Mathematics (to appear).
3. 3. M. Matić, C.E.M. Pearce and J. Pecarić, Improvements of some bounds on entropy measures in information theory, Math. Inequal. and Appl. 1, 295-304 (1998).
4. 4. M. Matić, C.E.M. Pearce and J. Pecarić, Refinements of some bounds in information theory, J. Austr. Math. Soc. Ser. B (to appear).
5. 5. S.S. Dragomir and C.J. Goh, A counterpart of Jensen's discrete inequality for differentiable convex mappings and applications in information theory, Mathl. Comput. Modelling 24 (2), 1-11 (1996).
6. 6. D.S. Mitrinović, Analytic Inequalities, Springer-Verlag, (1970).
7. 7. M. Matić, Jensen's inequality and applications in information theory (in Croatian), Ph.D. Thesis, University of Zagreb, Croatia.
8. 8. S.S. Dragomir and C.J. Goh, Some bounds on entropy measures in information theory, Appl. Math. Lett. 10 (3), 23-28 (1997).
9. 9. R.J. McEliece, The Theory of Information and Coding, Addison-Wesley, Reading, MA, (1977).