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

In this paper, the impact of limited resources on achievable rates in relay channels is investigated. Resource limitation is modeled as a rate constraint, R, which constrains the rate at which a relay can reliably decode or source-code data. With this constraint in hand, the achievable rates for several protocols are derived and compared: decode-and-forward, estimate-and-forward, a Markovian am...

A new coding scheme for general N -node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode–forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the Cover–El Gamal partial decode–forward coding scheme for 3-node relay channels. The key idea of the scheme is to precode all the codewords of the entire network at...

We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a...

We investigate the superposition strategy and its usefulness in terms of achievable information theoretic rates. The achievable rate of the superposition of block Markov encoding (decode-forward) and side information encoding (compress-forward) for the three-node Gaussian relay channel is analyzed. It is generally believed that the superposition can out perform decode-forward or compress-forwar...