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 R{'e}nyi relative entropy satisfies the Data Processing Inequality (DPI) for a certain range of 's and 's. Moreover, the range is completely characterized by Zhang in `20. We prove necessary and algebraically sufficient conditions to saturate the DPI for the R{'e}nyi relative entropy whenever and . Moreover, these conditions coincide whenever .
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)