The capacity region of a class of broadcast channels with a sequence of less noisy receivers
classification
💻 cs.IT
math.IT
keywords
broadcastlessnoisysequencecapacitychannelsclassproblem
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.