We consider the role of Wyner-Ziv binning in compress-forward for relay channels. In the
one-way relay channel, we analyze a compress-forward scheme without Wyner-Ziv binning …

Consider a relay cascade, ie, a network where a source node, a sink node and a certain
number of intermediate source/relay nodes are arranged on a line and where adjacent node …

Quantize-map-and-forward (QMF) is a relaying scheme that has been shown to achieve the
capacity of Gaussian relay networks to within a constant gap. Under QMF the compression …

This paper investigates low-latency streaming codes for a three-node relay network. The
source transmits a sequence of messages (streaming messages) to the destination through …

The simultaneous relay channel is investigated where the source is unaware of the channel
statistic controlling the communication but knows that this statistic is one of two possible …

Consider a primitive relay channel, where, a source X wants to send information to a
destination Y with the help of a relay Z and the relay can communicate to the destination via …

A new coding scheme for multicasting a message over a general relay network is presented
that extends both network coding for graphical networks by Ahlswede, Cai, Li, and Yeung …

In this paper, we propose a new achievable rate for two-level relay networks by introducing
a new strategy named simultaneous partial and backward decoding. In the proposed …

Compute-and-forward (CF) harnesses interference in wireless communications by exploiting
structured coding. The key idea of CF is to compute integer combinations of code words from …

Gupta and Kumar (see IEEE Transactions an Information Theory, vol. 46, no. 2, p. 388-404,
2000) determined the capacity of wireless networks under certain assumptions, among them …