27 citations · 160 across the 25 of their papers we have counts for
26 papers
Information Inequalities via Ideas from Additive Combinatorics
Chin Wa Lau, Chandra Nair
Ruzsa's equivalence theorem provided a framework for converting certain families of inequalities in additive combinatorics to entropic inequalities (which sometimes did not possess…
A Strengthened Cutset Upper Bound on the Capacity of the Relay Channel and Applications
Abbas El Gamal, Amin Gohari, Chandra Nair
We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse tec…
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality
Venkat Anantharam, Varun Jog, Chandra Nair
The entropy power inequality (EPI) and the Brascamp-Lieb inequality (BLI) are fundamental inequalities concerning the differential entropies of linear transformations of random vec…
Sub-optimality of the Han--Kobayashi Achievable Region for Interference Channels
Chandra Nair, Lingxiao Xia, Mehdi Yazdanpanah
Han-Kobayashi achievable region is the best known inner bound for a general discrete memoryless interference channel. We show that the capacity region can be strictly larger than t…
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
Venkat Anantharam, Amin Gohari, Sudeep Kamath +1
In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-Rényi maximal correlation of a pair of random , as well as of the chordal slope of the n…
On Marton's inner bound for broadcast channels
Amin Gohari, Chandra Nair, Venkat Anantharam
Marton's inner bound is the best known achievable region for a general discrete memoryless broadcast channel. To compute Marton's inner bound one has to solve an optimization probl…