On Marton's Inner Bound for Broadcast Channels

Marton's inner bound is the best known achievable region for a general discrete memory less broadcast channel. To compute Marton's inner bound one has to solve an optimization problem over a set of joint distributions on the input and auxiliary random variables. The optimizers turn out to be structured in many cases. Finding properties of optimizers not only results in efficient evaluation of the region, but it may also help one to prove factorization of Marton's inner bound (and thus its optimality). The first part of this paper formulates this factorization approach explicitly and states some conjectures and results along this line. The second part of this paper focuses primarily on the structure of the optimizers.

Provided by: sharick Topic: Networking Date Added: Feb 2012 Format: PDF

Find By Topic