In this paper, we propose network coding, as an efficient and low cost option for the implementation of blockMarkov coding for cooperative communications. Cooperative communications is a strategy where users, besides transmitting their own encoded information, also relay re-encoded versions of other users’ information to a common destination. Our work is motivated by the recent information-theo...

We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of diversity-multiplexing tradeoff (DMT). We examine several projections of this most general problem taking into account the network geometry (clustered or non-clustered), the processing capability of the relays (half-duplex or full-duplex) and the number of antennas the nod...

In this paper, we study the performance of the four-node multiple-access relay channel with binary Network Coding (NC) in various Rayleigh fading scenarios. In particular, two relay protocols, decode-and-forward (DF) and demodulate-and-forward (DMF) are considered. In the first case, channel decoding is performed at the relay before NC and forwarding. In the second case, only demodulation is pe...

Cooperative diversity is an effective technique to combat the fading phenomena in wireless communications without additional complexity of multiple antennas. Multiple terminals in the network form a virtual antenna array in a distributed fashion. Even though each of them is equipped with only one antenna, spatial diversity gain can be achieved through cooperation. In this chapter, we discuss re...

The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially with the number of messages. We derive a more compact expression for the capacity region of this channel in which the number of rate bounds depends on the d...

This paper considers a fully-connected interference network with a relay in which multiple users equipped with a single antenna want to exchange multiple unicast messages with other users in the network by sharing the relay equipped with multiple antennas. For such a network, the degrees of freedom (DoF) are derived by considering various message exchange scenarios: a multi-user fullyconnected ...

Reliable transmission of a discrete memoryless source over a multiple-relay relay-broadcast network is considered. Motivated by sensor network applications, it is assumed that the relays and the destinations all have access to side information correlated with the underlying source signal. Joint source-channel cooperative transmission is studied in which the relays help the transmission of the s...

We study the problem of simulating a two-user multiple-access channel (MAC) over multiple access network noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies source random variable each, while decoder observes i.i.d. side-information variable. There are rate-limited communication links between each encoder decoder, there is pairwise shared randomness all...

Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...

Enabling cooperation among nodes of a wireless network can significantly reduce the required transmit power as well as the induced intra-network interference. Due to the practical half-duplexity constraint of the cooperating nodes, they are prohibited to simultaneously transmit and receive data at the same time-frequency resource. The purpose of this dissertation is to illustrate the value of c...