一个强软覆盖引理及其应用
A Stronger Soft-Covering Lemma and Applications
摘要:
Wyner软覆盖引理是信息论安全性、可分解性、信道综合和信源编码的可分解性证明的重要工具。这里的结果锐化软覆盖的要求远离期望值分析。相反,随机码本示出实现软覆盖现象具有高概率。失败的概率在块长度上是双指数小的,通过联合边界可以实现更强大的应用程序。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。