The capacity of a class of deterministic relay channels with the transmitter input X, the
receiver output Y, the relay output Y 1= f (X, Y), and a separate communication link from the …

This paper studies lower bounds on the capacity of the relay channel with orthogonal
receiver components (also referred to as primitive relay channel). We show that the lower …

It has been shown recently that the overall throughput of dense wireless networks can
increase significantly when wireless nodes collaborate in transmission of different packets …

Let {(U_ i, V_ i)\} _ i= 1^ n be a source of independent identically distributed (iid) discrete
random variables with joint probability mass function p (u, v) and common part w= f (u)= g (v) …

The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best
known upper bound on the capacity of the Gaussian relay channel. We develop a new …

A new universal coding/decoding scheme for random access with collision detection is
given in case of two senders. The result is used to give achievable joint source-channel …

Refined bounds on the probability of decoding error for arbitrary multiple-access channels
with correlated sources are derived. The contribution of this paper is to give new upper …

The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks
of interference networks. We prove two coding theorems for the compound multiple-access …

We derive the capacity region of arbitrarily varying multiple-access channels (AV-MACs)
with conferencing encoders for both deterministic and random coding. For a complete …

We consider an n-relay Gaussian diamond network where a source communicates to a
destination with the help of n half-duplex relays. Achieving rates close to the capacity of this …