A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality

DOI10.1109/TIT.2017.2753224zbMATH Open1390.94747arXiv1509.01380OpenAlexW2756124386MaRDI QIDQ4566602FDOQ4566602

Silas L. Fong, Vincent Y. F. Tan

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We prove that the Gaussian broadcast channel with two destinations admits the strong converse property. This implies that for every sequence of block codes operated at a common rate pair with an asymptotic average error probability $<1$, the rate pair must lie within the capacity region derived by Cover and Bergmans. The main mathematical tool required for our analysis is a logarithmic Sobolev inequality known as the Gaussian Poincar'e inequality.

Full work available at URL: https://arxiv.org/abs/1509.01380

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Cited In (2)

• A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)
• Second-order converses via reverse hypercontractivity

This page was built for publication: A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566602)