4 problems

Consider a two-user Gaussian multicast channel in which the interference sequences on the two links are jointly and individually independent and identically distributed Gaussian pr…

Geometric dirty-paper conjecture. The geometric dirty-paper coding scheme is optimal, in the sense that the encoder cannot exploit the known interference beyond the geometric appro…

The setting is a two-user Gaussian interference channel with transmitter cooperation, in which $u_1$ and $u_2$ denote cooperative private messages and dirty-paper coding can be use…

A Gaussian vector broadcast channel has capacity region $\mathcal{C}_{\mathrm{BC}}$, and dirty-paper coding (DPC) achieves the rate region $\mathcal{C}_{\mathrm{DPC}}$. Dirty-paper…