The Capacity Region of Some Classes of Parallel Degraded Broadcast Channels with Three Receivers and Three-Degraded Message Sets

We consider a broadcast channel with three receivers and three-degraded message sets, where the transmitter has a common message intended for all three receivers, a message intended for receivers 2 and 3, and a private message intended for receiver 3. The messages are transmitted over a family of parallel degraded broadcast channels. In the most general case, there are six parallel degraded broadcast channels with different orders of degradedness. We determine the capacity region for two classes of broadcast channels, one with five parallel degraded broadcast channels and the other with three parallel degraded broadcast channels. The main difficulty is in identifying the relevant auxiliary random variables in the proofs of the converse. To accomplish this, we make use of an information theoretic inequality that can be proven using the Csiszar-sum identity.