We give a comprehensive discussion on coding techniques for the primitive relay channel,
in which the channel input X is transmitted to the relay Y1 and the ultimate receiver Y over a …

An Interference Channel with Generalized Feedback (IFC-GF) models a wireless network
where the sources can sense the channel activity. The signal overheard from the channel …

We develop a new upper bound on the capacity of the relay channel that is tighter than
previously known upper bounds. This upper bound is proved using traditional weak …

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 …

Low-density parity-check (LDPC) lattices were the first family of lattices to show efficient
decoding in high dimensions. We consider a case of these lattices with one binary LDPC …

An achievable rate for the discrete memoryless relay channel with receiver-transmitter
feedback is proposed based on block-Markov superposition encoding. The achievable rate …

Decode and forward (DF) and compress and forward (CF) are two efficient cooperation
strategies for relay networks. The combination of the DF and CF strategies is promising to …

This paper investigates the performance of dual-hop full-duplex relaying schemes subject to
co-channel interference (CCI) and noise. In our analysis, two main scenarios are …

The relay channel with private messages (RCPM) is a generalized relay channel model
where in addition to the traditional communication from source to destination (assisted by …

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 …