On Error Exponents of Encoder-Assisted Communication Systems

DOI10.1109/TIT.2021.3111541MaRDI QIDQ5032553zbMATH OpenOpenAlexFDO

Authors Neri Merhav

Publication date 17 February 2022

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

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

zbMATH Keywords

continuous-alphabet, additive white Gaussian channelserror exponentsfinite-alphabet, modulo-additive channels

Mathematics Subject Classification ID

Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We consider a point-to-point communication system, where in addition to the encoder and the decoder, there is a helper that observes non-causally the realization of the noise vector and provides a (lossy) rate-$R_{mboxinyh}$ description of it to the encoder ($R_{mboxinyh}<infty$). While Lapidoth and Marti (2020) derived coding theorems, associated with achievable channel-coding rates (of the main encoder) for this model, here our focus is on error exponents. We consider both continuous-alphabet, additive white Gaussian channels and finite-alphabet, modulo-additive channels, and for each one of them, we study the cases of both fixed-rate and variable-rate noise descriptions by the helper. Our main finding is that, as long as the channel-coding rate, $R$, is below the helper-rate, $R_{mboxinyh}$, the achievable error exponent is unlimited (i.e., it can be made arbitrarily large), and in some of the cases, it is even strictly infinite (i.e., the error probability can be made strictly zero). However, in the range of coding rates $(R_{mboxinyh},R_{mboxinyh}+C_0)$, $C_0$ being the ordinary channel capacity (without help), the best achievable error exponent is finite and strictly positive, although there is a certain gap between our upper bound (converse bound) and lower bound (achievability) on the highest achievable error exponent. This means that the model of encoder-assisted communication is essentially equivalent to a model, where in addition to the noisy channel between the encoder and decoder, there is also a parallel noiseless bit-pipe of capacity $R_{mboxinyh}$. We also extend the scope to the Gaussian multiple access channel (MAC) and characterize the rate sub-region, where the achievable error exponent is unlimited or even infinite.

Cited in

(9)

• scientific article; zbMATH DE number 3478752 (Why is no real title available?)
• On the error exponent of convolutionally coded ARQ
• scientific article; zbMATH DE number 1029231 (Why is no real title available?)
• The Error Exponent of Variable-Length Codes Over Markov Channels With Feedback
• Error Exponents of Optimum Decoding for the Interference Channel
• Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel
• Error Exponents for Broadcast Channels With Degraded Message Sets
• On Convexity of Error Rates in Digital Communications
• Improving the compression rate versus \(L^{1}\) error ratio in cell-average error control algorithms

This page was built for publication: On Error Exponents of Encoder-Assisted Communication Systems

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