By Topic

Achievable second-order coding rates for the wiretap channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Vincent Y. F. Tan ; Inst. for Infocomm Res. (I2R), STAR, Singapore, Singapore

We 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 εr and εs respectively. We leverage on the connection between wiretap channel coding and channel resolvability to derive tighter secrecy bounds than those available in the literature. We 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.

Published in:

Communication Systems (ICCS), 2012 IEEE International Conference on

Date of Conference:

21-23 Nov. 2012