An outer bound for 2-receiver discrete memoryless broadcast channels
classification
💻 cs.IT
math.IT
keywords
outerboundboundsbroadcastdiscretememorylesspresentedchannel
read the original 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.
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.