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 …

This paper deals with the problem of multicasting a set of discrete memoryless correlated
sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set …

This paper investigates the capacity of a wireless two-way relay channel in which two end
nodes exchange information via a relay node. The capacity is defined in the information …

Numerous applications demand communication schemes that minimize the transmission
delay while achieving a given level of reliability. An extreme case is high-frequency trading …

Capacity approaching codes for relay channels Page 1 Capacity Approaching Codes for Relay
Channels 1 Zheng Zhang Dept. of Electrical Engineering Arizona State University Tempe, AZ …

In this paper, we derive the capacity of the Gaussian degraded'cheap'relay channel,
consisting of nodes using'cheap'radios operating in TDD mode when transmitting and …

Consider a memoryless relay channel, where the relay is connected to the destination with
an isolated bit pipe of capacity C 0. Let C (C 0) denote the capacity of this channel as a …

The problem of maximum rate achievable with analog network coding for a unicast
communication over a layered wireless relay network with directed links is considered. A …

We consider the diamond network where a source communicates with the destination
through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity …

This correspondence studies coding strategies for a three-node relay channel. We start with
the basic coding strategies of Cover and El Gamal: the relay decodes the source message …