We consider the Gaussian N-relay diamond network, where a source wants to communicate
to destination node through a layer of N-relay nodes. We investigate the following question …

Consider a Gaussian relay network where a number of sources communicate to a
destination with the help of several layers of relays. Recent work has shown that a compress …

We present an achievable rate for general Gaussian relay networks. We show that the
achievable rate is within a constant number of bits from the information-theoretic cut-set …

The capacity of a particular large Gaussian relay network is determined in the limit as the
number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and …

Beginning with work by Avestimehr, Diggavi and Tse, there have been a series of papers
showing that the capacity of Gaussian relay networks can be closely approximated by the …

A new coding scheme for general N-node relay networks is presented for unicast, multicast,
and broadcast. The proposed distributed decode-forward scheme combines and …

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 …

In this paper, we propose a new concept of relaying named parallel relaying to obtain a new
achievable rate for relay networks. The proposed encoding scheme is based on partial …

In the classical compress-and-forward relay scheme developed by (Cover and El Gamal,
1979), the decoding process operates in a successive way: the destination first decodes the …

We consider a source that transmits information to a receiver by routing it over a
communication network represented by a graph and examine rate benefits that finite …