Paul Cuff
Published 2015-08-07Version 1
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.
Comments: IEEE CNS 2015, 2nd Workshop on Physical-layer Methods for Wireless Security, 4 pages
Solutions to Integrals Involving the Marcum Q-Function and Applications
Principal Inertia Components and Applications
Low-Rank Signal Processing: Design, Algorithms for Dimensionality Reduction and Applications
![QR code for arXiv:1508.01602 [cs.IT]](http://oss.arxitics.com/images/favicon.svg)