Next Article in Journal
Cross-Entropy Method for Content Placement and User Association in Cache-Enabled Coordinated Ultra-Dense Networks
Next Article in Special Issue
Confidential Cooperative Communication with the Trust Degree of Jammer
Previous Article in Journal
Intermittency and Self-Organisation in Turbulence and Statistical Mechanics
Previous Article in Special Issue
Physical Layer Key Generation in 5G and Beyond Wireless Communications: Challenges and Opportunities
Article Menu
Issue 6 (June) cover image

Export Article

Open AccessArticle

List-Decoding Capacity of the Gaussian Arbitrarily-Varying Channel

School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85287, USA
Author to whom correspondence should be addressed.
This paper is an extended version of our paper published in the 2018 IEEE International Symposium on Information Theory (ISIT)
Entropy 2019, 21(6), 575;
Received: 11 April 2019 / Revised: 27 May 2019 / Accepted: 4 June 2019 / Published: 7 June 2019
(This article belongs to the Special Issue Information-Theoretic Security II)
PDF [794 KB, uploaded 7 June 2019]


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 Csiszár-Narayan method for the arbitrarily-varying channel.
Keywords: gaussian arbitrarily-varying channel; list-decoding; stochastic encoder; capacity gaussian arbitrarily-varying channel; list-decoding; stochastic encoder; capacity
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Hosseinigoki, F.; Kosut, O. List-Decoding Capacity of the Gaussian Arbitrarily-Varying Channel. Entropy 2019, 21, 575.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top