On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels

2008/04/24 by Chandra Nair, Nair, Chandra, Vincent Wang Zizhou +1
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.0804.3825

openalex publication_date 2008/04/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer bound that was also presented in [N-EG'07]. We are able to further express the best outer bound in a form that is computable, i.e. there are bounds on the cardinalities of the auxiliary random variables. The inner and outer bounds coincide for all channels for which the capacity region is known and it is not known whether the regions described by these bounds are same or different. We present a channel, where assuming a certain conjecture backed by simulations and partial theoretical results, one can show that the bounds are different.

Related

• An outer bound for 2-receiver discrete memoryless broadcast channels
• An outer bound to the capacity region of the broadcast channel
• Two Classes of Broadcast Channels With Side-Information: Capacity Outer Bounds
• Capacity Bounds and a Certain Capacity Region for Special Three-Receiver Broadcast Channels with Side Information
• On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets