Finite-Blocklength Bounds for Wiretap Channels
Information Theory
2016-01-25 v1 math.IT
Abstract
This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing bounds. The bounds also lead to the tightest second-order coding rate for discrete memoryless and Gaussian wiretap channels.
Cite
@article{arxiv.1601.06055,
title = {Finite-Blocklength Bounds for Wiretap Channels},
author = {Wei Yang and Rafael F. Schaefer and H. Vincent Poor},
journal= {arXiv preprint arXiv:1601.06055},
year = {2016}
}
Comments
extended version of a paper submitted to ISIT 2016