Achievable Second-Order Coding Rates for the Wiretap Channel

The authors derive lower bounds to the second-order coding rates for the wiretap channel. The decoding error probability and the information leakage measured in terms of the variational distance secrecy metric are fixed at some constants. They leverage on the connection between wiretap channel coding and channel resolvability to derive tighter secrecy bounds than those available in the literature. They then use central limit theorem-style analysis to evaluate these bounds for the discrete memoryless wiretap channel with cost constraints and the Gaussian wiretap channel.

Provided by: National University of Singapore Topic: Networking Date Added: May 2012 Format: PDF

Find By Topic