The capacity region of a class of broadcast channels with a sequence of less noisy receivers

The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k 3. We prove that superposition coding is indeed optimal for a class of broadcast channels with a sequence of less noisy receivers. This class contains the k = 3 case of the open problem mentioned above, thus resolving its capacity region.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Chandra Nair, Zizhou Vincent Wang
• Keywords: Broadcast Channel, Capacity Region, CORR 2010, Education, Open Problem