Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel
Document Type
Conference Proceeding
Publication Date
8-15-2018
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.
Identifier
85052465591 (Scopus)
ISBN
[9781538647806]
Publication Title
IEEE International Symposium on Information Theory Proceedings
External Full Text Location
https://doi.org/10.1109/ISIT.2018.8437724
ISSN
21578095
First Page
2007
Last Page
2011
Volume
2018-June
Grant
CNS-1526547
Fund Ref
National Science Foundation
Recommended Citation
Kosut, Oliver and Kliewer, Jorg, "Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel" (2018). Faculty Publications. 8447.
https://digitalcommons.njit.edu/fac_pubs/8447
