A network with two sources, one relay, and one destination is considered. Under the
assumption of noisy source-relay links causing the relay to be unable to decode without …

A communication scenario where a source communicates with a destination over a directed
layered relay network is considered. Each relay performs analog network coding where it …

We consider a relay network having K source-destination pairs. Finding the capacity region
of such a network with multiple unicast sessions is in general difficult. By focusing on a …

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

Consider a relay cascade, ie a network where the source node, the sink node and a certain
number of intermediate relay nodes are arranged in a line. We assume that adjacent node …

We revisit the primitive relay channel, introduced by Cover in 1987. Recent work derived
upper bounds on the capacity of this channel that are tighter than the classical cutset bound …

We investigate the binary‐symmetric parallel‐relay network where there is one source, one
destination, and multiple relays in parallel. We show that forwarding relays, where the relays …

We consider an erasure relay network where the sender sends an information flow that can
be received by a receiver and a relay. The relay forwards some part of the information and …

This paper studies a Gaussian relay network, where the relays can either transmit or receive
at any given time, but not both. Known upper (cut-set) and lower (noisy network coding) …

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 …