Consider a Gaussian relay network where a source node communicates to a destination
node with the help of several layers of relays. Recent work has shown that compress-and …

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 …

In this paper, we provide an improved lower bound on the rate achieved by noisy network
coding in arbitrary Gaussian relay networks, whose gap to the cutset upper bound depends …

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 …

We determine the asymptotic capacity of a Gaussian multiple-relay channel as the number
of relays tends to infinity. The upper bound is an application of the cut-set theorem, and the …

This paper studies the relaying strategies and the approximate capacity of the classic three-
node Gaussian relay channel, but where the noises at the relay and at the destination are …

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 …

Consider a composite unicast relay network where the channel statistic is randomly drawn
from a set of conditional distributions indexed by θ ϵ Θ, which is assumed to be unknown at …

We examine the extent to which Gaussian relay networks can be approximated by
deterministic networks, and present two results, one negative and one positive. The gap …