Broadcast channels with receiver message side information

In this thesis, we investigate the capacity region of broadcast channels where each receiver may partially or fully know some of the messages requested by other receivers as receiver message side information (RMSI). This form of side information appears in applications, such as multimedia broadcasting with packet loss, caching systems, and the downlink phase of applications modeled by multi-way relay channels. We start with the two-receiver discrete memoryless broadcast channel where each receiver requests both common and private messages, and knows a priori part of the private message requested by the other receiver. We first propose a pre-coding designed to construct the transmission scheme of a two-receiver channel with RMSI using the one for the channel without RMSI. Employing this pre-coding, we then derive a uni-fied inner bound that covers three categories of the channel: (i) channel without state, (ii) channel with states known causally to the transmitter, and (iii) channel with states known non-causally to the transmitter. We show that our inner bound is tight for some new cases in each of the three categories as well as all cases whose capacity region was known previously. We next focus on the Gaussian broadcast channel to investigate how to utilize RMSI where there are more than two receivers. We consider the three-receiver additive white Gaussian noise broadcast channel where each receiver requests a private message, and may fully know some of the messages requested by the other receivers. We first propose a classification to group the side information configurations that lead to the same capacityachieving transmission scheme. We then construct transmission schemes, and derive inner and outer bounds for different groups. This establishes the capacity region for 52 out of all 64 possible side information configurations, and tightens the best-known inner bound and/or outer bound for the remaining 12. We also address the Gaussian multiple-input multiple-output (MIMO) broadcast channel with an arbitrary number of antennas at each node. We investigate the degrees-of-freedom (DoF) region of this channel, which determines the capacity region in the high signal-to-noise ratio regime. We first establish the DoF region of the two-receiver MIMO channel where each receiver requests both common and private messages, and knows a priori part of the private message requested by the other receiver. We then consider the three-receiver MIMO channel where each receiver requests a private message, and may fully know some of the messages requested by the other receivers. We establish the DoF region of the channel for all 16 possible non-isomorphic side information configurations using techniques beyond the two-receiver case.