A note on outer bounds for broadcast channel
classification
💻 cs.IT
math.IT
keywords
boundouternoteabsenceboundsbroadcastchannelcomputable
read the original abstract
In this note we establish two facts concerning the so-called {\em New-Jersey} outer bound. We show that this outer bound is equivalent to a much simpler {\em computable} region; and secondly we show that in the absence of private information this bound is exactly same as the $UV$-outerbound.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The Capacity Region for Classes of Sum-Broadcast Channels
Capacity region of sum-broadcast channels with degraded/less-noisy/etc. components equals the auxiliary-receiver outer bound matched to Marton's inner bound, generalizing El Gamal 1980.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.