A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels
A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels
We prove the strong converse for the N -source Gaussian multiple access channel. In particular, we show that any rate tuple that can be supported by a sequence of codes with asymptotic average error probability <;1 must lie in the Cover-Wyner capacity region. Our proof consists of the following. First, …