An outer bound for 2-receiver discrete memoryless broadcast channels

Abstract

An outer bound to the two-receiver discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.

3 pages, a note

Cited by in corpus (2)

• Capacity Bounds for Broadcast Channels with Confidential Messages
• Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property