In a wireless network with a single source and a single destination and an arbitrary number
of relay nodes, what is the maximum rate of information flow achievable? We make progress …

We analyze the asymptotic behavior of compute-and-forward relay networks in the regime of
high signal-to-noise ratios. We consider a section of such a network consisting of K …

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 …

We consider the-relay Gaussian diamond network where a source node communicates to a
destination node via parallel relays through a cascade of a Gaussian broadcast (BC) and a …

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 …

This paper considers a Gaussian relay network where a source transmits a message to a
destination with the help of N half-duplex relays. The information theoretic cut-set upper …

This monograph illustrates a novel approach, which is based on changing the focus to seek
approximate solutions accompanied by universal guarantees on the gap to optimality, in …

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 …

Consider several source nodes communicating across a wireless network to a destination
node with the help of several layers of relay nodes. Recent work by Avestimehr has …

This paper considers the Gaussian half-duplex relay channel (G-HD-RC): a channel model
where a source transmits a message to a destination with the help of a relay that cannot …