We consider the discrete memoryless symmetric primitive relay channel, where, a source
wants to send information to a destination with the help of a relay and the relay can …

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 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 …

Consider a primitive diamond relay channel, where a source X wants to send information to
a destination with the help of two relays Y 1 and Y 2, and the two relays can communicate to …

An upper bound on the capacity of a primitive three-node discrete memoryless relay channel
is considered, where a source X wants to send information to destination Y with the help of a …

We consider the broadcast-relay channel: a broadcast channel where receivers are
permitted to assist in the distribution of data to other receivers by relaying. We extend the …

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 …

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

The multicast capacity is determined for networks that have deterministic channels with
broadcasting at the transmitters and no interference at the receivers. The multicast capacity …

This paper studies lower bounds on the capacity of the relay channel with orthogonal
receiver components (also referred to as primitive relay channel). We show that the lower …