Finite-Blocklength Bounds for Wiretap Channels

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.

extended version of a paper submitted to ISIT 2016

References in corpus (4)

• 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

Cited by in corpus (3)

• First and Second Order Asymptotics in Covert Communication
• Position-based coding and convex splitting for private communication over quantum channels
• Semantic Security on Wiretap Channels using Universal Hashing with Fading Applications