Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel

Oliver Kosut, Jorg Kliewer

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

Abstract

Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength achievability bound is presented, roughly analogous to the random coding union bound for non-adversarial channels. This finite blocklength bound, along with a known converse bound, is used to derive bounds on the dispersion of discrete memoryless AVCs without shared randomness, and with cost constraints on the input and the state. These bounds are tight for many channels of interest, including the binary symmetric AVC. However, the bounds are not tight if the deterministic and random code capacities differ.

Original languageEnglish (US)
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2007-2011
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

Costs
Converse
Randomness
Union
Coding
Binary
Arbitrary
Model

ASJC Scopus subject areas

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

Cite this

Kosut, O., & Kliewer, J. (2018). Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (Vol. 2018-June, pp. 2007-2011). [8437724] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437724

Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel. / Kosut, Oliver; Kliewer, Jorg.

2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. p. 2007-2011 8437724.

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

Kosut, O & Kliewer, J 2018, Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel. in 2018 IEEE International Symposium on Information Theory, ISIT 2018. vol. 2018-June, 8437724, Institute of Electrical and Electronics Engineers Inc., pp. 2007-2011, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 6/17/18. https://doi.org/10.1109/ISIT.2018.8437724
Kosut O, Kliewer J. Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel. In 2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June. Institute of Electrical and Electronics Engineers Inc. 2018. p. 2007-2011. 8437724 https://doi.org/10.1109/ISIT.2018.8437724
Kosut, Oliver ; Kliewer, Jorg. / Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel. 2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. pp. 2007-2011
@inproceedings{80b3b2a76bcb450eb20f161c42bfb413,
title = "Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel",
abstract = "Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength achievability bound is presented, roughly analogous to the random coding union bound for non-adversarial channels. This finite blocklength bound, along with a known converse bound, is used to derive bounds on the dispersion of discrete memoryless AVCs without shared randomness, and with cost constraints on the input and the state. These bounds are tight for many channels of interest, including the binary symmetric AVC. However, the bounds are not tight if the deterministic and random code capacities differ.",
author = "Oliver Kosut and Jorg Kliewer",
year = "2018",
month = "8",
day = "15",
doi = "10.1109/ISIT.2018.8437724",
language = "English (US)",
isbn = "9781538647806",
volume = "2018-June",
pages = "2007--2011",
booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel

AU - Kosut, Oliver

AU - Kliewer, Jorg

PY - 2018/8/15

Y1 - 2018/8/15

N2 - Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength achievability bound is presented, roughly analogous to the random coding union bound for non-adversarial channels. This finite blocklength bound, along with a known converse bound, is used to derive bounds on the dispersion of discrete memoryless AVCs without shared randomness, and with cost constraints on the input and the state. These bounds are tight for many channels of interest, including the binary symmetric AVC. However, the bounds are not tight if the deterministic and random code capacities differ.

AB - Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength achievability bound is presented, roughly analogous to the random coding union bound for non-adversarial channels. This finite blocklength bound, along with a known converse bound, is used to derive bounds on the dispersion of discrete memoryless AVCs without shared randomness, and with cost constraints on the input and the state. These bounds are tight for many channels of interest, including the binary symmetric AVC. However, the bounds are not tight if the deterministic and random code capacities differ.

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

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

U2 - 10.1109/ISIT.2018.8437724

DO - 10.1109/ISIT.2018.8437724

M3 - Conference contribution

SN - 9781538647806

VL - 2018-June

SP - 2007

EP - 2011

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

PB - Institute of Electrical and Electronics Engineers Inc.

ER -