arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.06396cs.ITmath.IT
收藏

高概率软覆盖

Soft Covering with High Probability

Paul Cuff

摘要:

Wyner的软覆盖引理是信息论安全性、可分解性和信道合成的可验证性证明的中心分析步骤。它也可以用于有损信源编码中的简单可压缩性证明。这项工作锐化软覆盖的要求,远离预期价值分析。相反,随机码本示出实现软覆盖现象具有高概率。失败的概率在块长度上是超指数小的,使得许多应用程序能够通过联合边界。这项工作给出了软覆盖的指数衰减率和二阶码本率的界。

英文摘要:

Wyner's soft-covering lemma is the central analysis step for achievability proofs of information theoretic security, resolvability, and channel synthesis. It can also be used for simple achievability proofs in lossy source coding. This work 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 super-exponentially small in the block-length, enabling many applications through the union bound. This work gives bounds for both the exponential decay rate of total variation and the second-order codebook rate for soft covering.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑