research
∙
11/14/2022
A Lego-Brick Approach to Coding for Network Communication
Coding schemes for several problems in network information theory are co...
share
research
∙
02/12/2022
An Information-Theoretic Proof of the Kac–Bernstein Theorem
A short, information-theoretic proof of the Kac–Bernstein theorem, which...
research
∙
02/05/2022
One-Nearest-Neighbor Search is All You Need for Minimax Optimal Regression and Classification
Recently, Qiao, Duan, and Cheng (2019) proposed a distributed nearest-ne...
research
∙
02/04/2022
On Universal Portfolios with Continuous Side Information
A new portfolio selection strategy that adapts to a continuous side-info...
research
∙
02/04/2022
Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting
A class of parameter-free online linear optimization algorithms is propo...
research
∙
02/13/2021
Sequential prediction under log-loss with side information
The problem of online prediction with sequential side information under ...
research
∙
12/31/2019
On the Interactive Capacity of Finite-State Protocols
The interactive capacity of a noisy channel is the highest possible rate...
research
∙
12/10/2019
On the Capacity Regions of Cloud Radio Access Networks with Limited Orthogonal Fronthaul
Uplink and downlink cloud radio access networks are modeled as two-hop K...
research
∙
08/20/2019
A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels
The interactive capacity of a channel is defined in this paper as the ma...
research
∙
06/17/2019
Distributed Source Simulation With No Communication
We consider the problem of distributed source simulation with no communi...
research
∙
05/27/2019
Wyner VAE: Joint and Conditional Generation with Succinct Common Representation Learning
A new variational autoencoder (VAE) model is proposed that learns a succ...
research
∙
09/10/2018
On the Capacity Region for Secure Index Coding
We study the index coding problem in the presence of an eavesdropper, wh...
research
∙
05/22/2018
Nearest neighbor density functional estimation based on inverse Laplace transform
A general approach to L_2-consistent estimation of various density funct...
research
∙
05/09/2018
Optimal Achievable Rates for Computation With Random Homologous Codes
Building on the framework of nested coset codes by Padakandla and Pradha...
research
∙
01/27/2018
Capacity Theorems for Distributed Index Coding
In index coding, a server broadcasts multiple messages to their respecti...
research
∙
01/23/2018
Homologous Codes for Multiple Access Channels
Building on recent development by Padakandla and Pradhan, and by Lim, Fe...
research
∙
12/30/2017
Shannon Capacity is Achievable for Binary Interactive First-Order Markovian Protocols
We address the problem of simulating an arbitrary binary interactive fir...
research
∙
06/28/2017
