Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel

Oliver Kosut; Jorg Kliewer

doi:10.1109/ISIT.2018.8437724

Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel

Oliver Kosut, Jorg Kliewer

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

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 language	English (US)
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2007-2011
Number of pages	5
ISBN (Print)	9781538647806
DOIs	https://doi.org/10.1109/ISIT.2018.8437724
State	Published - Aug 15 2018
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: Jun 17 2018 → Jun 22 2018

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2018-June
ISSN (Print)	2157-8095

Other

Other	2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/Territory	United States
City	Vail
Period	6/17/18 → 6/22/18

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2018.8437724

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 (pp. 2007-2011). Article 8437724 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437724

@inproceedings{a46dcd038d3c453eba182beeefa5149a,

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",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Symposium on Information Theory, ISIT 2018 ; Conference date: 17-06-2018 Through 22-06-2018",

year = "2018",

month = aug,

day = "15",

doi = "10.1109/ISIT.2018.8437724",

language = "English (US)",

isbn = "9781538647806",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2007--2011",

booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",

address = "United States",

}

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., 8437724, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, 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

Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel. / Kosut, Oliver; Kliewer, Jorg.
2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 2007-2011 8437724 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

AN - SCOPUS:85052465591

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2007

EP - 2011

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 17 June 2018 through 22 June 2018

ER -

Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this