Information Inequalities via Ideas from Additive Combinatorics

Autor:	Lau, Chin Wa, Nair, Chandra
Rok vydání:	2023
Předmět:	Computer Science - Information Theory Mathematics - Combinatorics Mathematics - Number Theory
Druh dokumentu:	Working Paper
Popis:	Ruzsa'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. As a first step to further these equivalences, we establish an information-theoretic characterization of the magnification ratio that could also be of independent interest. Comment: 15 pages, The authors were made aware that some of the results had been obtained earlier. The revised version acknowledges and references this work. A conference version of this was published in the proceeding of IEEE ISIT 2023. s
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2312.11017 Zobrazit plný text záznamu View this record from Arxiv