Network coding for two-way relay channels and broadcast erasure channels with feedback

This thesis addresses two multi-user communication scenarios that share common ground: The Two-Way Relay Channel and the Broadcast Packet Erasure Channel with feedback and channel memory. For the first scenario, we focus on Quantize-and-Forward Strategies. We propose algorithms to optimally choose the quantizer for both vector and scalar quantizers. A system with practical codes and iterative message passing decoding is designed, implemented, and evaluated in numerical simulations. In the second part we derive outer bounds on the capacity region of the Two-Receiver Broadcast Packet Erasure Channel with feedback and channel memory. The outer bounds can be achieved by practical coding schemes and hence describe the capacity region of the scenario. This capacity result is complemented by the derivation of suboptimal heuristic schemes with low complexity.