155 citations · 682 across the 44 of their papers we have counts for
44 papers
A Lego-Brick Approach to Coding for Network Communication
Nadim Ghaddar, Shouvik Ganguly, Lele Wang +1
Coding schemes for several problems in network information theory are constructed starting from point-to-point channel codes that are designed for symmetric channels. Given that th…
On the Interactive Capacity of Finite-State Protocols
Assaf Ben-Yishai, Young-Han Kim, Rotem Oshman +1
The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the intera…
On the Capacity Regions of Cloud Radio Access Networks with Limited Orthogonal Fronthaul
Shouvik Ganguly, Seung-Eun Hong, Young-Han Kim
Uplink and downlink cloud radio access networks are modeled as two-hop K-user L-relay networks, whereby small base-stations act as relays for end-to-end communications and are conn…
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich +1
The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably…
Distributed Source Simulation With No Communication
Tomer Berg, Ofer Shayevitz, Young-Han Kim +1
We consider the problem of distributed source simulation with no communication, in which Alice and Bob observe sequences and respectively, drawn from a joint distributi…
On the Capacity Region for Secure Index Coding
Yuxin Liu, Badri N. Vellambi, Young-Han Kim +1
We study the index coding problem in the presence of an eavesdropper, where the aim is to communicate without allowing the eavesdropper to learn any single message aside from the m…