Short message noisy network coding (SNNC) differs from long message noisy network
coding (LNNC) in that one transmits many short messages in blocks rather than using one …

This work considers the problem of sending a 1-bit message over an acyclic network, where
the “edge” connecting any two nodes is a memoryless binary-input/symmetric-output (BISO) …

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 …

In this paper, we consider a discrete memoryless state-dependent relay channel with non-
causal channel state information (CSI). We investigate three different cases in which perfect …

The discrete memoryless state-dependent relay channel (SD-RC) is considered in this
study. Two main cases are investigated: SD-RC with non-causal channel state information …

This thesis addresses two problems of network information theory: coding for relay networks
and (accurate) approximations of distributions based on unnormalized informational …

In this paper, we present results on the equivalence of some coding strategies for the
general relay channel. Cover & El Gamal described two basic coding strategies for the relay …

In this paper, we study a state-dependent relay channel where perfect channel state
information (CSI) is causally known to transmitters in both symmetric and asymmetric …

The problem of communicating a single message to a destination in presence of multiple
relay nodes, referred to as cooperative unicast network, is considered. First, we introduce …

This paper studies the error propagation phenomenon for a multi-way relay channel based
on binary phase shift keying (BPSK) modulation and network coding in the physical layer …