On Renyi Entropy Power Inequalities
Abstract
This paper gives improved R\'{e}nyi entropy power inequalities (R-EPIs). Consider a sum of independent continuous random vectors taking values on , and let . An R-EPI provides a lower bound on the order- R\'enyi entropy power of that, up to a multiplicative constant (which may depend in general on ), is equal to the sum of the order- R\'enyi entropy powers of the random vectors . For , the R-EPI coincides with the well-known entropy power inequality by Shannon. The first improved R-EPI is obtained by tightening the recent R-EPI by Bobkov and Chistyakov which relies on the sharpened Young's inequality. A further improvement of the R-EPI also relies on convex optimization and results on rank-one modification of a real-valued diagonal matrix.
Keywords
Cite
@article{arxiv.1601.06555,
title = {On Renyi Entropy Power Inequalities},
author = {Eshed Ram and Igal Sason},
journal= {arXiv preprint arXiv:1601.06555},
year = {2016}
}
Comments
Revised version of a submission to the IEEE Trans. on Information Theory. Presented in part at ISIT 2016, Barcelona, July 2016