Error Exponents for the Gaussian Channel With Active Noisy Feedback

DOI10.1109/TIT.2011.2104991zbMATH Open1366.94244arXiv0909.4203MaRDI QIDQ5281016FDOQ5281016

Authors: Younghan Kim, Amos Lapidoth, Tsachy Weissman

Publication date: 27 July 2017

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

Abstract: We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an emph{expected} block power constraint on the forward link and study both emph{almost-sure} and emph{expected} block power constraints on the feedback link. In both cases the best achievable error exponents are finite and grow approximately proportionally to the larger between the signal-to-noise ratios on the forward and feedback links. The error exponents under almost-sure block power constraints are typically strictly smaller than under expected constraints. Some of the results extend to communication at arbitrary rates below capacity and to general discrete memoryless channels.

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

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited In (2)

This page was built for publication: Error Exponents for the Gaussian Channel With Active Noisy Feedback

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