Network Information Theory
In this project we consider multi-sender multi-receiver communication networks with a particular focus on broadcast channels. In these channels, a transmitter wishes to send a number of messages to multiple receivers through a shared medium. The request of each receiver may include private messages (requested by only this receiver) and/or common messages (requested by more than one receiver).
The particular communication networks of interest include multi-way relay channels (which model systems where multiple users exchange their messages through a relay, and the users cannot communicate directly without the relay), and more general broadcast channels with receiver message side information. Receiver message side information occurs when the receivers know, beforehand, some of the messages requested by the other receivers.
In this project, we consider both noiseless and noisy broadcast channels. In the noiseless case, we aim to derive the optimal compression rate (widely known as the index coding problem). In the noisy case, we aim to derive the capacity of the channel.