New entropy bounds via uniformly convex functions
In this paper we give extensions of Jensen’s discrete inequality considering the class of uniformly convex functions. We also introduce lower and upper bounds for Jensen’s inequality (for uniformly convex functions), and we apply this results in information theory and obtain new and strong bounds fo...
Saved in:
Published in | Chaos, solitons and fractals Vol. 141; p. 110360 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.12.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper we give extensions of Jensen’s discrete inequality considering the class of uniformly convex functions. We also introduce lower and upper bounds for Jensen’s inequality (for uniformly convex functions), and we apply this results in information theory and obtain new and strong bounds for Shannon’s entropy of a probability distribution. |
---|---|
ISSN: | 0960-0779 1873-2887 |
DOI: | 10.1016/j.chaos.2020.110360 |