Saturating the Data Processing Inequality for \alpha-z Renyi Relative Entropy

From MaRDI portal
Saturating the Data Processing Inequality for $\alpha-z$ Renyi Relative Entropy




Abstract: It has been shown that the alpha−z R{'e}nyi relative entropy satisfies the Data Processing Inequality (DPI) for a certain range of alpha's and z's. Moreover, the range is completely characterized by Zhang in `20. We prove necessary and algebraically sufficient conditions to saturate the DPI for the alpha−z R{'e}nyi relative entropy whenever 1<alphaleq2 and fracalpha2leqzleqalpha. Moreover, these conditions coincide whenever alpha=z.














This page was built for publication: Saturating the Data Processing Inequality for $\alpha-z$ Renyi Relative Entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6342842)