A note on outer bounds for broadcast channel
Information Theory
2011-01-05 v1 math.IT
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 -outerbound.
Cite
@article{arxiv.1101.0640,
title = {A note on outer bounds for broadcast channel},
author = {Chandra Nair},
journal= {arXiv preprint arXiv:1101.0640},
year = {2011}
}
Comments
This was presented in the International Zurich Seminar 2010. This is just for a documented proof of the result