Dispersion of the discrete arbitrarily-varying channel with limited shared randomness

Oliver Kosut, Jörg Kliewer

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

1 Citation (Scopus)

Abstract

The second-order behavior of the discrete memoryless arbitrarily-varying channel is considered in the fixed error regime when the encoder and decoder share randomness that is independent from the adversarial choice of state. The dispersion (coefficient of the second-order term) is exactly characterized for most channels of interest when infinite shared randomness is allowed, and it is shown that precisely the same dispersion is achievable with only O (log n) bits of shared randomness. We also show that the dispersion is identical to that of the non-adversarial channel induced by the adversary simply choosing an i.i.d. state sequence according to the correct distribution. Further, we present some remarks on the connection to the compound channel, as well as on cost constraints for input and state sequences.

Original languageEnglish (US)
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1242-1246
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Other

Other2017 IEEE International Symposium on Information Theory, ISIT 2017
CountryGermany
CityAachen
Period6/25/176/30/17

Fingerprint

Randomness
Encoder
Costs
Coefficient
Term

ASJC Scopus subject areas

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

Cite this

Kosut, O., & Kliewer, J. (2017). Dispersion of the discrete arbitrarily-varying channel with limited shared randomness. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 1242-1246). [8006727] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006727

Dispersion of the discrete arbitrarily-varying channel with limited shared randomness. / Kosut, Oliver; Kliewer, Jörg.

2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1242-1246 8006727.

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

Kosut, O & Kliewer, J 2017, Dispersion of the discrete arbitrarily-varying channel with limited shared randomness. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006727, Institute of Electrical and Electronics Engineers Inc., pp. 1242-1246, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 6/25/17. https://doi.org/10.1109/ISIT.2017.8006727
Kosut O, Kliewer J. Dispersion of the discrete arbitrarily-varying channel with limited shared randomness. In 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 1242-1246. 8006727 https://doi.org/10.1109/ISIT.2017.8006727
Kosut, Oliver ; Kliewer, Jörg. / Dispersion of the discrete arbitrarily-varying channel with limited shared randomness. 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 1242-1246
@inproceedings{c01f479eec2e4cd0b17aa9116eee2b7f,
title = "Dispersion of the discrete arbitrarily-varying channel with limited shared randomness",
abstract = "The second-order behavior of the discrete memoryless arbitrarily-varying channel is considered in the fixed error regime when the encoder and decoder share randomness that is independent from the adversarial choice of state. The dispersion (coefficient of the second-order term) is exactly characterized for most channels of interest when infinite shared randomness is allowed, and it is shown that precisely the same dispersion is achievable with only O (log n) bits of shared randomness. We also show that the dispersion is identical to that of the non-adversarial channel induced by the adversary simply choosing an i.i.d. state sequence according to the correct distribution. Further, we present some remarks on the connection to the compound channel, as well as on cost constraints for input and state sequences.",
author = "Oliver Kosut and J{\"o}rg Kliewer",
year = "2017",
month = "8",
day = "9",
doi = "10.1109/ISIT.2017.8006727",
language = "English (US)",
pages = "1242--1246",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Dispersion of the discrete arbitrarily-varying channel with limited shared randomness

AU - Kosut, Oliver

AU - Kliewer, Jörg

PY - 2017/8/9

Y1 - 2017/8/9

N2 - The second-order behavior of the discrete memoryless arbitrarily-varying channel is considered in the fixed error regime when the encoder and decoder share randomness that is independent from the adversarial choice of state. The dispersion (coefficient of the second-order term) is exactly characterized for most channels of interest when infinite shared randomness is allowed, and it is shown that precisely the same dispersion is achievable with only O (log n) bits of shared randomness. We also show that the dispersion is identical to that of the non-adversarial channel induced by the adversary simply choosing an i.i.d. state sequence according to the correct distribution. Further, we present some remarks on the connection to the compound channel, as well as on cost constraints for input and state sequences.

AB - The second-order behavior of the discrete memoryless arbitrarily-varying channel is considered in the fixed error regime when the encoder and decoder share randomness that is independent from the adversarial choice of state. The dispersion (coefficient of the second-order term) is exactly characterized for most channels of interest when infinite shared randomness is allowed, and it is shown that precisely the same dispersion is achievable with only O (log n) bits of shared randomness. We also show that the dispersion is identical to that of the non-adversarial channel induced by the adversary simply choosing an i.i.d. state sequence according to the correct distribution. Further, we present some remarks on the connection to the compound channel, as well as on cost constraints for input and state sequences.

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

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

U2 - 10.1109/ISIT.2017.8006727

DO - 10.1109/ISIT.2017.8006727

M3 - Conference contribution

SP - 1242

EP - 1246

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

PB - Institute of Electrical and Electronics Engineers Inc.

ER -