The capacity region of the two-receiver vector Gaussian broadcast channel with private and common messages

TL;DR

This paper introduces a novel method to prove the optimality of Gaussian distributions in multiterminal information theory, demonstrating that Marton's inner bound achieves the capacity of vector Gaussian broadcast channels with a common message.

Contribution

The paper presents a new technique for establishing Gaussian optimality and applies it to prove the capacity of vector Gaussian broadcast channels with common messages.

Findings

Marton's inner bound achieves the capacity of vector Gaussian broadcast channels with common messages.

The new method simplifies proving Gaussian optimality in multiterminal problems.

Abstract

We develop a new method for showing the optimality of the Gaussian distribution in multiterminal information theory problems. As an application of this method we show that Marton's inner bound achieves the capacity of the vector Gaussian broadcast channels with common message.