2017 IEEE International Symposium on Information Theory (ISIT) 2017
DOI: 10.1109/isit.2017.8007075
|View full text |Cite
|
Sign up to set email alerts
|

Sharp bounds on Arimoto's conditional Rényi entropies between two distinct orders

Abstract: This study examines sharp bounds on Arimoto's conditional Rényi entropy of order β with a fixed another one of distinct order α = β. Arimoto inspired the relation between the Rényi entropy and the r -norm of probability distributions, and he introduced a conditional version of the Rényi entropy. From this perspective, we analyze the r -norms of particular distributions. As results, we identify specific probability distributions whose achieve our sharp bounds on the conditional Rényi entropy. The sharp bounds d… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 29 publications
(74 reference statements)
0
8
0
Order By: Relevance
“…The idea of the proof is different from those offered in previous studies (for instance, [23][24][25][26][27]) as explained below. Interestingly, the technique developed in this study might possibly be useful for tackling more complicated problems regarding optimization issues in information theory and other research areas, such as the conditional Rényi entropy (as in [28][29][30]), for instance.…”
Section: P Imentioning
confidence: 99%
“…The idea of the proof is different from those offered in previous studies (for instance, [23][24][25][26][27]) as explained below. Interestingly, the technique developed in this study might possibly be useful for tackling more complicated problems regarding optimization issues in information theory and other research areas, such as the conditional Rényi entropy (as in [28][29][30]), for instance.…”
Section: P Imentioning
confidence: 99%
“…We show that our Fano-type inequalities can be specialized to some known generalizations of Fano’s inequality [ 20 , 21 , 22 , 23 ] on Shannon’s and Rényi’s information measures. Therefore, one of our technical contributions is a unified proof of Fano’s inequality for conditional information measures via majorization theory.…”
Section: Introductionmentioning
confidence: 99%
“…In [ 54 ], Ben-Bassat–Raviv explored several inequalities between the (unconditional) Rényi entropy and the error probability. Generalizations of Fano’s inequality from the conditional Shannon entropy to Arimoto’s conditional Rényi entropy introduced in [ 8 ] were recently and independently investigated by Sakai–Iwata [ 22 ] and Sason–Verdú [ 23 ]. Specifically, Sakai–Iwata [ 22 ] provided sharp upper/lower bounds on for fixed with two distinct orders .…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations