TY - GEN
T1 - A stronger soft-covering lemma and applications
AU - Cuff, Paul
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/12/3
Y1 - 2015/12/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84966455377&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84966455377&partnerID=8YFLogxK
U2 - 10.1109/CNS.2015.7346808
DO - 10.1109/CNS.2015.7346808
M3 - Conference contribution
AN - SCOPUS:84966455377
T3 - 2015 IEEE Conference on Communications and NetworkSecurity, CNS 2015
SP - 40
EP - 43
BT - 2015 IEEE Conference on Communications and NetworkSecurity, CNS 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd IEEE International Conference on Communications and Network Security, CNS 2015
Y2 - 28 September 2015 through 30 September 2015
ER -