This paper investigates the capacity regions of two-receiver broadcast channels where each receiver: (i) has both common and private-message requests. ; (ii) knows part of the private message requested by the other receiver as side information. We first propose a transmission scheme and derive an inner bound for the two-receiver memoryless broadcast channel. We next prove that this inner bound is tight for the deterministic channel and the more capable channel, thereby establishing their capacity regions.We show that this inner bound is also tight for all classes of two-receiver broadcast channels whose capacity regions were known prior to this work. Our proposed scheme is consequently a unified capacity-achieving scheme for these classes of broadcast channels.
2015 IEEE International Symposium on Information Theory (ISIT). Proceedings of the 2015 IEEE International Symposium on Information Theory (Hong Kong 14-19 June, 2015) p. 386-390