On the entropy power inequality for the Rényi entropy of order [0,1]
October 02, 2017 · Declared Dead · 🏛 IEEE Transactions on Information Theory
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Information Theory
R.I.P.
👻
Ghosted
R.I.P.
👻
Ghosted
A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems
R.I.P.
👻
Ghosted
Towards Smart and Reconfigurable Environment: Intelligent Reflecting Surface Aided Wireless Network
📚
📚
The Cartographer
Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges
R.I.P.
👻
Ghosted
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
📚
📚
The Cartographer
An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
👻
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
👻
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
👻
Ghosted