Chandra Nair

According to our database1, Chandra Nair authored at least 63 papers between 2002 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Awards

IEEE Fellow

IEEE Fellow 2018, "For contributions to network information theory".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On Marton's Achievable Region: Local Tensorization for Product Channels with a Binary Component.
Proceedings of the Information Theory and Applications Workshop, 2020

On the AND-OR Interference Channel and the Sandglass Conjecture.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On optimal weighted-sum rates for the modulo sum problem.
Proceedings of the IEEE International Symposium on Information Theory, 2020

New Outer Bounds for the Two-Receiver Broadcast Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On the structure of certain non-convex functionals and the Gaussian Z-interference channel.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Invariance of the Han-Kobayashi Region With Respect to Temporally-Correlated Gaussian Inputs.
IEEE Trans. Inf. Theory, 2019

On the Evaluation of Marton's Inner Bound for Two-Receiver Broadcast Channels.
IEEE Trans. Inf. Theory, 2019

On the size of pairwise-colliding permutations.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On the Scalar Gaussian Interference Channel.
Proceedings of the 2018 Information Theory and Applications Workshop, 2018

2017
On the Gaussian Z-interference channel.
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

Sub-optimality of superposition coding region for three receiver broadcast channel with two degraded message sets.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Reverse hypercontractivity region for the binary erasure channel.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
On the optimality of randomized time division and superposition coding for the broadcast channel.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Gaussian Z-interference channel: Around the corner.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

Evaluating hypercontractivity parameters using information measures.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Equivalent characterization of reverse Brascamp-Lieb-type inequalities using information measures.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Some results on the scalar Gaussian interference channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Sub-optimality of Han-Kobayashi achievable region for interference channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

The strong data processing constant for sums of i.i.d. random variables.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
The Capacity Region of the Two-Receiver Gaussian Vector Broadcast Channel With Private and Common Messages.
IEEE Trans. Inf. Theory, 2014

On Marton's Inner Bound and Its Optimality for Classes of Product Broadcast Channels.
IEEE Trans. Inf. Theory, 2014

Interference channels with very weak interference.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On hypercontractivity and a data processing inequality.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
On Broadcast Channels With Binary Inputs and Symmetric Outputs.
IEEE Trans. Inf. Theory, 2013

An Information Inequality and Evaluation of Marton's Inner Bound for Binary Input Broadcast Channels.
IEEE Trans. Inf. Theory, 2013

On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
CoRR, 2013

Improved cardinality bounds on the auxiliary random variables in Marton's inner bound.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On hypercontractivity and the mutual information between Boolean functions.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
On three-receiver more capable channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On Marton's inner bound for broadcast channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

The capacity region of the two-receiver vector Gaussian broadcast channel with private and common messages.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
The Capacity Region of the Three Receiver Less Noisy Broadcast Channel.
IEEE Trans. Inf. Theory, 2011

The capacity region of classes of product broadcast channels
CoRR, 2011

A note on outer bounds for broadcast channel
CoRR, 2011

The capacity region for two classes of product broadcast channels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Capacity regions of two new classes of two-receiver broadcast channels.
IEEE Trans. Inf. Theory, 2010

An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder
CoRR, 2010

An information inequality for the BSSC broadcast channel.
Proceedings of the Information Theory and Applications Workshop, 2010

The capacity region of a class of broadcast channels with a sequence of less noisy receivers.
Proceedings of the IEEE International Symposium on Information Theory, 2010

An information inequality and evaluation of Marton's inner bound for binary input broadcast channels.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
The capacity region of a class of three-receiver broadcast channels with degraded message sets.
IEEE Trans. Inf. Theory, 2009

Proof of the local REM conjecture for number partitioning. II. Growing energy scales.
Random Struct. Algorithms, 2009

Proof of the local REM conjecture for number partitioning. I: Constant energy scales.
Random Struct. Algorithms, 2009

An inequality for the binary skew-symmetric broadcast channel and its implications
CoRR, 2009

On 3-receiver broadcast channels with 2-degraded message sets.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Capacity regions of two new classes of 2-receiver broadcast channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Comments on "broadcast channels with arbitrarily correlated sources".
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
An outer bound for 2-receiver discrete memoryless broadcast channels
CoRR, 2008

On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets
CoRR, 2008

On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels
CoRR, 2008

The capacity region of a class of 3-receiver broadcast channels with degraded message sets.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
An Outer Bound to the Capacity Region ofthe Broadcast Channel.
IEEE Trans. Inf. Theory, 2007

The capacity of a class of 3-receiver broadcast channels with degraded message sets
CoRR, 2007

Simple deterministic approximation algorithms for counting matchings.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

A "Chicken & Egg" Network Coding Problem.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
On entropy for mixtures of discrete and continuous variables
CoRR, 2006

A rigorous proof of the cavity method for counting matchings
CoRR, 2006

An Outer Bound to the Capacity Region of the Broadcast Channel.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Asymptotic filtering and entropy rate of a hidden Markov process in the rare transitions regime.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
A new proof of Parisi's conjecture for the finite random assignment problem.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Energy-efficient Scheduling of Packet Transmissions over Wireless Networks.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002


  Loading...