arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.00714cs.ITmath.IT
收藏

软覆盖的精确指数

Exact Exponent for Soft Covering

Semih Yagli, Paul Cuff

摘要:

这项工作建立了精确的指数的软覆盖现象的无记忆信道下的总变化度量时,随机(i.i.d.)。和恒定组成)信道码。在此建立的指数,是严格的改进,在两个方向上的界限在文献中找到。这补充了最近的文献在相对熵度量下建立精确指数;然而,证明技术有显着差异,因此,两个结果都不平凡地暗示另一个。发现的指数意味着新的和改进的界限,使用软覆盖作为他们的可分解性参数的各种问题,包括新的下限的可分解性指数和窃听通道中的保密指数。

英文摘要:

This work establishes the exact exponents for the soft-covering phenomenon of a memoryless channel under the total variation metric when random (i.i.d. and constant-composition) channel codes are used. The exponents, established herein, are strict improvements in both directions on bounds found in the literature. This complements the recent literature establishing the exact exponents under the relative entropy metric; however, the proof techniques have significant differences, and thus, neither result trivially implies the other. The found exponents imply new and improved bounds for various problems that use soft-covering as their achievability argument, including new lower bounds for the resolvability exponent and the secrecy exponent in the wiretap channel.

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

↑