关于DMC容量和Renyi发散的新结果
New Results on the DMC Capacity and Renyi's Divergence
摘要:
本文的工作是“沃尔什频谱分析及其在密码学中的应用”项目的一部分。该项目启动了寻找最大(和/或显着大)沃尔什系数以及随机抽样的未知分布的索引位置的研究。该问题的提出在密码学和通信领域具有重要意义。2015年初,Yi JANET Lu首次构造了新的虚信道转移矩阵,并将香农信道编码问题引入统计密码分析。传统方法无法计算的传输矩阵的信道容量首次成为研究热点。对于一些离散无记忆信道(DMC),它是已知的,容量可以解析计算,在一般情况下,没有封闭形式的解决方案。这项工作是关于在新的设置信道容量的分析结果。我们研究了Blahut-Arimoto算法(历史上给出了第一个数值解)和$N\times M$过渡矩阵的最新结果[Sutter et al'2014]。对于$ε$近似(即,近似解的期望绝对精度),前者具有计算复杂性$ O(MN^2 \log N/ε) $,而后者具有复杂度$ O(M^2N\sqrt{\log N}/ε) $。研究了Renyi的$1/2$度发散度与广义$1/2$度信道容量之间的关系。
英文摘要:
This work is part of a project "Walsh Spectrum Analysis and the Cryptographic Applications". The project initiates the study of finding the largest (and/or significantly large) Walsh coefficients as well as the index positions of an unknown distribution by random sampling. This proposed problem has great significance in cryptography and communications. In early 2015, Yi JANET Lu first constructed novel imaginary channel transition matrices and introduced Shannon's channel coding problem to statistical cryptanalysis. For the first time, the channel capacity results of well-chosen transition matrices, which might be impossible to calculate traditionally, become of hottest research focus. For a few Discrete Memoryless Channels (DMCs), it is known that the capacity can be computed analytically; in general, there is no closed-form solution. This work is concerned with analytical results of channel capacity in the new setting. We study both the Blahut-Arimoto algorithm (which gave the first numerical solution historically) and the most recent results [Sutter et al'2014] for the transition matrix of $N\times M$. For an $ε$-approximation (i.e., the desired absolute accuracy of the approximate solution) of the capacity, the former has the computational complexity $ O(MN^2 \log N/ε) $, while the latter has the complexity $ O(M^2N\sqrt{\log N}/ε) $. We also study the relation of Renyi's divergence of degree $1/2$ and the generalized channel capacity of degree $1/2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。