On the entropy power inequality for the Rényi entropy of order [0,1]

October 02, 2017 · Declared Dead · 🏛 IEEE Transactions on Information Theory

👻 CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Arnaud Marsiglietti, James Melbourne arXiv ID 1710.00800 Category cs.IT: Information Theory Cross-listed math.PR Citations 36 Venue IEEE Transactions on Information Theory Last Checked 6 months ago
Abstract
Using a sharp version of the reverse Young inequality, and a Rényi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors are able to derive Rényi entropy power inequalities for log-concave random vectors when Rényi parameters belong to $(0,1)$. Furthermore, the estimates are shown to be sharp up to absolute constants.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Information Theory

Died the same way — 👻 Ghosted