2000 character limit reached
The capacity region of a class of broadcast channels with a sequence of less noisy receivers (1001.1799v2)
Published 12 Jan 2010 in cs.IT and math.IT
Abstract: 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 solve this problem for the case k=3. We prove that superposition coding is optimal for a class of broadcast channels with a sequence of less noisy receivers. T