Finite-Blocklength Bounds for Wiretap Channels
arXiv:1601.06055
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.
arXiv commentextended version of a paper submitted to ISIT 2016
References in corpus (6)
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- The Third-Order Term in the Normal Approximation for the AWGN Channel
- On the Secrecy Exponent of the Wire-tap Channel
- Strong Converse for a Degraded Wiretap Channel via Active Hypothesis Testing
- Non-Asymptotic Output Statistics of Random Binning and Its Applications