Coding schemes for several problems in network information theory are
co...
A short, information-theoretic proof of the Kac–Bernstein theorem, which...
Recently, Qiao, Duan, and Cheng (2019) proposed a distributed
nearest-ne...
A new portfolio selection strategy that adapts to a continuous
side-info...
A class of parameter-free online linear optimization algorithms is propo...
The problem of online prediction with sequential side information under
...
The interactive capacity of a noisy channel is the highest possible rate...
Uplink and downlink cloud radio access networks are modeled as two-hop K...
The interactive capacity of a channel is defined in this paper as the ma...
We consider the problem of distributed source simulation with no
communi...
A new variational autoencoder (VAE) model is proposed that learns a succ...
We study the index coding problem in the presence of an eavesdropper, wh...
A general approach to L_2-consistent estimation of various density
funct...
Building on the framework of nested coset codes by Padakandla and Pradha...
In index coding, a server broadcasts multiple messages to their respecti...
Building on recent development by Padakandla and Pradhan, and by Lim, Fe...
We address the problem of simulating an arbitrary binary interactive
fir...
Recommender systems aim to find an accurate and efficient mapping from
h...