On Error Exponents of Encoder-Assisted Communication Systems

11/20/2020
by   Neri Merhav, et al.
0

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_ description of it to the encoder (R_ < ∞). 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_, 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_,R_+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_. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2022

Error Exponents of the Dirty-Paper and Gel'fand-Pinsker Channels

We derive various error exponents for communication channels with random...
research
07/30/2020

A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence

A new converse bound is presented for the two-user multiple-access chann...
research
08/03/2022

Multi-Bit Relaying over a Tandem of Channels

We study error exponents for the problem of relaying a message over a ta...
research
02/26/2018

Timeliness in Lossless Block Coding

We examine lossless data compression from an average delay perspective. ...
research
10/31/2021

Capacity of Noisy Permutation Channels

We establish the capacity of a class of communication channels introduce...
research
11/30/2017

The Dispersion of Universal Joint Source-Channel Coding for Arbitrary Sources and Additive Channels

We consider a universal joint source channel coding (JSCC) scheme to tra...
research
02/16/2018

A Mismatched Joint Source-Channel Coding Perspective of Probabilistic Amplitude Shaping: Achievable Rates and Error Exponents

Probabilistic Amplitude Shaping (PAS) is a novel method of reliable comm...

Please sign up or login with your details

Forgot password? Click here to reset