Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression

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...

Full description

Bibliographic Details
Main Author: Igal Sason
Format: Article
Language:English
Published: MDPI AG 2018-11-01
Series:Entropy
Subjects:
Majorization
Rényi entropy
Rényi divergence
cumulant generating functions
guessing moments
lossless source coding
fixed-to-variable source codes
Huffman algorithm
Tunstall codes
Online Access:https://www.mdpi.com/1099-4300/20/12/896

Internet

https://www.mdpi.com/1099-4300/20/12/896

Similar Items