Information-theoretic inequalities in additive combinatorics

Mokshay Madiman, Adam W. Marcus, Prasad Tetali

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

8 Scopus citations

Abstract

We review recent developments that adopt an information-theoretic approach to the study of sumset inequalities in additive combinatorics.

Original languageEnglish (US)
Title of host publicationIEEE Information Theory Workshop 2010, ITW 2010
DOIs
StatePublished - Jul 27 2010
EventIEEE Information Theory Workshop 2010, ITW 2010 - Cairo, Egypt
Duration: Jan 6 2010Jan 8 2010

Publication series

NameIEEE Information Theory Workshop 2010, ITW 2010

Other

OtherIEEE Information Theory Workshop 2010, ITW 2010
CountryEgypt
CityCairo
Period1/6/101/8/10

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Keywords

  • Additive combinatorics
  • Entropy inequalities
  • Set cardinality inequalities
  • Sumsets

Fingerprint Dive into the research topics of 'Information-theoretic inequalities in additive combinatorics'. Together they form a unique fingerprint.

  • Cite this

    Madiman, M., Marcus, A. W., & Tetali, P. (2010). Information-theoretic inequalities in additive combinatorics. In IEEE Information Theory Workshop 2010, ITW 2010 [5503129] (IEEE Information Theory Workshop 2010, ITW 2010). https://doi.org/10.1109/ITWKSPS.2010.5503129