A min-entropy power inequality for groups

Peng Xu, James Melbourne, Mokshay Madiman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

We develop a general notion of rearrangement for certain metric groups, and prove a Hardy-Littlewood type inequality. Combining this with a characterization of the extreme points of the set of probability measures with bounded densities with respect to a reference measure, we establish a general min-entropy inequality for convolutions. Special attention is paid to the integers where a min-entropy power inequality is conjectured and a partial result proved.

Original languageEnglish (US)
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages674-678
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2017 IEEE International Symposium on Information Theory, ISIT 2017
CountryGermany
CityAachen
Period6/25/176/30/17

Keywords

  • Infinity entropy power inequality
  • Max density
  • Rényi entropy

Fingerprint Dive into the research topics of 'A min-entropy power inequality for groups'. Together they form a unique fingerprint.

Cite this