2000 character limit reached
The capacity region of a class of broadcast channels with a sequence of less noisy receivers
Published 12 Jan 2010 in cs.IT and math.IT | (1001.1799v2)
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
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
