A Stronger Soft-Covering Lemma and Applications

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.

IEEE CNS 2015, 2nd Workshop on Physical-layer Methods for Wireless Security, 4 pages

References in corpus (2)

• Distributed Channel Synthesis
• Effective Secrecy: Reliability, Confusion and Stealth

Cited by in corpus (5)

• First and Second Order Asymptotics in Covert Communication
• The MAC Resolvability Region, Semantic Security and Its Operational Implications
• Distributed Source Simulation With No Communication
• One-Shot Distributed Source Simulation: As Quantum as it Can Get
• Wiretap channels with causal and non-causal state information: revisited