Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding

Fatemeh Hosseinigoki, Oliver Kosut

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

This paper considers list-decoding for the Gaussian arbitrarily-varying channel under the average probability of error criterion, where both the legitimate transmission and the state (or adversarial signal) are power limited. For list size L, the capacity is equivalent to the capacity of a standard Gaussian with the noise power raised by the adversary power, if the ratio of the adversary power to the transmitter power is less than L; otherwise, the capacity is zero. The converse proof involves showing that with enough power, an adversary can confuse the decoder by transmitting a superposition of several codewords while satisfying its power constraint with positive probability. The achievability proof uses a novel variant of the Csiszar-Narayan method for the arbitrarily-varying channel.

Original languageEnglish (US)
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages471-475
Number of pages5
Volume2018-June
ISBN (Print)9781538647806
DOIs
StatePublished - Aug 15 2018
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: Jun 17 2018Jun 22 2018

Other

Other2018 IEEE International Symposium on Information Theory, ISIT 2018
CountryUnited States
CityVail
Period6/17/186/22/18

Fingerprint

List Decoding
Decoding
Transmitters
Converse
Transmitter
Superposition
Zero

Keywords

  • Capacity
  • Gaussian arbitrarily-varying channel
  • List-decoding

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Hosseinigoki, F., & Kosut, O. (2018). Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (Vol. 2018-June, pp. 471-475). [8437866] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437866

Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding. / Hosseinigoki, Fatemeh; Kosut, Oliver.

2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. p. 471-475 8437866.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hosseinigoki, F & Kosut, O 2018, Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding. in 2018 IEEE International Symposium on Information Theory, ISIT 2018. vol. 2018-June, 8437866, Institute of Electrical and Electronics Engineers Inc., pp. 471-475, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 6/17/18. https://doi.org/10.1109/ISIT.2018.8437866
Hosseinigoki F, Kosut O. Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding. In 2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June. Institute of Electrical and Electronics Engineers Inc. 2018. p. 471-475. 8437866 https://doi.org/10.1109/ISIT.2018.8437866
Hosseinigoki, Fatemeh ; Kosut, Oliver. / Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding. 2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. pp. 471-475
@inproceedings{119d6288c2624009b302770233f37c29,
title = "Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding",
abstract = "This paper considers list-decoding for the Gaussian arbitrarily-varying channel under the average probability of error criterion, where both the legitimate transmission and the state (or adversarial signal) are power limited. For list size L, the capacity is equivalent to the capacity of a standard Gaussian with the noise power raised by the adversary power, if the ratio of the adversary power to the transmitter power is less than L; otherwise, the capacity is zero. The converse proof involves showing that with enough power, an adversary can confuse the decoder by transmitting a superposition of several codewords while satisfying its power constraint with positive probability. The achievability proof uses a novel variant of the Csiszar-Narayan method for the arbitrarily-varying channel.",
keywords = "Capacity, Gaussian arbitrarily-varying channel, List-decoding",
author = "Fatemeh Hosseinigoki and Oliver Kosut",
year = "2018",
month = "8",
day = "15",
doi = "10.1109/ISIT.2018.8437866",
language = "English (US)",
isbn = "9781538647806",
volume = "2018-June",
pages = "471--475",
booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding

AU - Hosseinigoki, Fatemeh

AU - Kosut, Oliver

PY - 2018/8/15

Y1 - 2018/8/15

N2 - This paper considers list-decoding for the Gaussian arbitrarily-varying channel under the average probability of error criterion, where both the legitimate transmission and the state (or adversarial signal) are power limited. For list size L, the capacity is equivalent to the capacity of a standard Gaussian with the noise power raised by the adversary power, if the ratio of the adversary power to the transmitter power is less than L; otherwise, the capacity is zero. The converse proof involves showing that with enough power, an adversary can confuse the decoder by transmitting a superposition of several codewords while satisfying its power constraint with positive probability. The achievability proof uses a novel variant of the Csiszar-Narayan method for the arbitrarily-varying channel.

AB - This paper considers list-decoding for the Gaussian arbitrarily-varying channel under the average probability of error criterion, where both the legitimate transmission and the state (or adversarial signal) are power limited. For list size L, the capacity is equivalent to the capacity of a standard Gaussian with the noise power raised by the adversary power, if the ratio of the adversary power to the transmitter power is less than L; otherwise, the capacity is zero. The converse proof involves showing that with enough power, an adversary can confuse the decoder by transmitting a superposition of several codewords while satisfying its power constraint with positive probability. The achievability proof uses a novel variant of the Csiszar-Narayan method for the arbitrarily-varying channel.

KW - Capacity

KW - Gaussian arbitrarily-varying channel

KW - List-decoding

UR - http://www.scopus.com/inward/record.url?scp=85052475774&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052475774&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2018.8437866

DO - 10.1109/ISIT.2018.8437866

M3 - Conference contribution

AN - SCOPUS:85052475774

SN - 9781538647806

VL - 2018-June

SP - 471

EP - 475

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -