Journal
ENTROPY
Volume 21, Issue 6, Pages -Publisher
MDPI
DOI: 10.3390/e21060575
Keywords
gaussian arbitrarily-varying channel; list-decoding; stochastic encoder; capacity
Categories
Funding
- National Science Foundation [CCF-1453718]
Ask authors/readers for more resources
In this paper, we determine the capacity of the Gaussian arbitrarily-varying channel with a (possibly stochastic) encoder and a deterministic list-decoder under the average probability of error criterion. We assume that both the legitimate and the adversarial signals are restricted by their power constraints. We also assume that there is no path between the adversary and the legitimate user but the adversary knows the legitimate user's code. We show that for any list size L, the capacity is equivalent to the capacity of a point-to-point Gaussian channel with noise variance increased by the adversary power, if the adversary has less power than L times the transmitter power; otherwise, the capacity is zero. In the converse proof, we show that if the adversary has enough power, then the decoder can be confounded by the adversarial superposition of several codewords while satisfying its power constraint with positive probability. The achievability proof benefits from a novel variant of the Csiszar-Narayan method for the arbitrarily-varying channel.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available