Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-23T21:26:18.486Z Has data issue: false hasContentIssue false

Refinements of some bounds in information theory

Published online by Cambridge University Press:  17 February 2009

M. Matić
Affiliation:
Mathematics Department, FESB, R. Boškovića B. B., Split, Croatia.
C. E. M. Pearce
Affiliation:
Applied Mathematics Department, The University of Adelaide, SA 5005, Australia.
J. Pečarić
Affiliation:
Applied Mathematics Department, The University of Adelaide, SA 5005, Australia.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Recently Dragomir and Goh have produced some interesting new bounds relating to entropy measures in information theory. We establish several refinements of their results.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2001

References

[1] Ash, R., Information theory (Interscience, New York, 1965).Google Scholar
[2] Biernacki, M., Pidek, H. and Ryll-Nardzewski, C., “Sur une inégalité entre des intégrales définies”, Ann. Univ. Mariae Curie–Sklodowska Sect. A Math. 4 (1950) 14.Google Scholar
[3] Dragomir, S. S. and Goh, C. J., “A counterpart of Jensen's discrete inequality for differentiable convex mappings and applications in information theory”. Math. Comput. Modelling 24 (1996) 111.CrossRefGoogle Scholar
[4] Matić, M., Pearce, C. E. M. and Pečarić, J., “Improvements of some bounds on entropy measures in information theory”. Math. Ineq. and Applic. 1 (1998) 295304.Google Scholar
[5] McEliece, R. J., The theory of information and coding (Addison–Wesley, Reading, Mass., 1977).Google Scholar
[6] Mitrinović, D. S., Pečarićc, J. E. and Fink, A. M., Classical and new inequalities in analysis (Kluwer Academ. Publ., Dordrecht, 1993).CrossRefGoogle Scholar