We study channel resolvability for the discrete memoryless multiple access channel with cribbing, i.e., the characterization of the amount of randomness required to approximate an i.i.d. output distribution in terms of ...

In this paper, we study the effect of side information on the recovery of a hidden community of size K inside a graph consisting of n nodes with K=o(n). We focus on side information with finite cardinality and bounded (as ...

The spatially correlated MIMO broadcast channel has grown in importance due to emerging interest in massive MIMO and mm-wave communication, but much about this channel remains unknown. In this paper, we study a two-user ...

The community detection problem, as a special case of inference on graphs, has received much attention lately. However, in the presence of continuous-valued side information, the behavior of a sharp threshold for exact ...

This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable ...

The Decode-Compress-Forward (DCF) is a generalization of Decode-Forward (DF) and Compress-Forward (CF). This paper investigates conditions under which DCF offers gains over DF and CF, addresses the problem of coded modulation ...

In this paper, we study the effect of side information on the information limits of recovering a hidden community of size K inside a graph consisting of n nodes with K = o(n). Side information for each node in the graph ...