Exact Exponent for Soft Covering

作     者：Yagli, Semih Cuff, Paul 

作者机构：Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Renaissance Technol LLC Long Isl City NY 11733 USA 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE信息论汇刊)

年 卷 期：2019年第65卷第10期

页      面：6234-6262页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Science Foundation [CCF-1350595] Air Force Office of Scientific Research [FA9550-15-1-0180] 

主　　题：Soft-covering lemma total variation distance channel resolvability random coding exponent random i.i.d. coding ensemble random constant-composition coding ensemble 

摘      要：This paper 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.