Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression
This paper provides tight bounds on the Rényi entropy of a function of a discrete random variable with a finite number of possible values, where the considered function is not one to one. To that end, a tight lower bound on the Rényi entropy of a discrete random variable with a fin...
Main Author: | Igal Sason |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-11-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/20/12/896 |
Similar Items
-
Are Guessing, Source Coding and Tasks Partitioning Birds of A Feather?
by: M. Ashok Kumar, et al.
Published: (2022-11-01) -
Variational Inference via Rényi Bound Optimization and Multiple-Source Adaptation
by: Dana Zalman (Oshri), et al.
Published: (2023-10-01) -
Conditional Rényi Divergences and Horse Betting
by: Cédric Bleuler, et al.
Published: (2020-03-01) -
The Interplay between Error, Total Variation, Alpha-Entropy and Guessing: Fano and Pinsker Direct and Reverse Inequalities
by: Olivier Rioul
Published: (2023-06-01) -
Conditional Rényi Entropy and the Relationships between Rényi Capacities
by: Gautam Aishwarya, et al.
Published: (2020-05-01)