𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An inequality for logarithmic mapping and applications for the shannon entropy

✍ Scribed by S.S. Dragomir

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
328 KB
Volume
46
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

using an inequality for convex functions by Andrica and %a [l] (2.1), we point out a new inequality for log mappings and apply it in information theory for the Shannon entropy and mutual information.

πŸ“œ SIMILAR VOLUMES

Inequalities for Shannon Entropy and Kol
Inequalities for Shannon Entropy and Kolmogorov Complexity
✍ Daniel Hammer; Andrei Romashchenko; Alexander Shen; Nikolai Vereshchagin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 272 KB

It was mentioned by Kolmogorov (1968, IEEE Trans. Inform. Theory 14, 662 664) that the properties of algorithmic complexity and Shannon entropy are similar. We investigate one aspect of this similarity. Namely, we are interested in linear inequalities that are valid for Shannon entropy and for Kolmo

An inequality for logarithms and applica
An inequality for logarithms and applications in information theory
✍ S.S. Dragomir; N.M. Dragomir; K. Pranesh πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 279 KB

A new analytic inequality for logarithms which provides a converse to arithmetic meangeometric mean inequality and its applications in information theory are given.

Logarithmic Convexity and Inequalities f
Logarithmic Convexity and Inequalities for the Gamma Function
✍ Milan Merkle πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 132 KB

We propose a method, based on logarithmic convexity, for producing sharp Ž . Ž . bounds for the ratio ⌫ x q ␀ r⌫ x . As an application, we present an inequality that sharpens and generalizes inequalities due to Gautschi, Chu, Boyd, Lazarevic-Ĺupas ¸, and Kershaw.