A Stronger Soft-Covering Lemma and Applications
Information Theory
2016-11-17 v1 math.IT
Abstract
Wyner's soft-covering lemma is a valuable tool for achievability proofs of information theoretic security, resolvability, channel synthesis, and source coding. The result herein sharpens the claim of soft-covering by moving away from an expected value analysis. Instead, a random codebook is shown to achieve the soft-covering phenomenon with high probability. The probability of failure is doubly-exponentially small in the block-length, enabling more powerful applications through the union bound.
Keywords
Cite
@article{arxiv.1508.01602,
title = {A Stronger Soft-Covering Lemma and Applications},
author = {Paul Cuff},
journal= {arXiv preprint arXiv:1508.01602},
year = {2016}
}
Comments
IEEE CNS 2015, 2nd Workshop on Physical-layer Methods for Wireless Security, 4 pages