Information Inequalities via Ideas from Additive Combinatorics
Refereed conference paper presented and published in conference proceedings

Full Text

Other information
AbstractRuzsa’s equivalence theorem provided a framework for converting certain families of inequalities in additive combinatorics to entropic inequalities (which sometimes did not possess
stand-alone entropic proofs). In this work, we first establish
formal equivalences between some families (different from Ruzsa)
of inequalities in additive combinatorics and entropic ones. Secondly,
we provide stand-alone entropic proofs for some previously
known entropic inequalities that we established via Ruzsa’s
equivalence theorem. As a first step to further these equivalences,
we provide an information theoretic characterization of the
magnification ratio that is also of independent interest.
All Author(s) ListChin Wa Ken Lau, Chandra Nair
Name of Conference2023 IEEE International Symposium on Information Theory (ISIT)
Start Date of Conference25/06/2023
End Date of Conference30/06/2023
Place of ConferenceTaipei
Country/Region of ConferenceTaiwan
LanguagesEnglish-United States

Last updated on 2024-12-04 at 11:05