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

删除通道输出熵最小化的隐字统计证明

A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics

Arash Atashpendar, David Mestel, A. W. Roscoe, Peter Y. A. Ryan

摘要:

从无记忆删除通道从已知长度$n$的均匀随机输入产生的输出,获得通道输入的后验分布。该分布的香农熵与均匀先验分布的香农熵之间的差测量了由长度为$m$的输出所传达的关于信道输入的信息量,并且很自然地询问哪些输出被极值化。这个问题在以前的工作中提出,其中它是基于实验数据,最小化和最大化后的熵的恒定字符串$\texttt{000}\ldots$和$\texttt{111}\ldots$和交替字符串$\texttt{0101}\ldots$和$\texttt{1010}\ldots$分别。在目前的工作中,我们证实了最小化猜想的渐近极限使用结果隐藏字统计。我们展示了如何分析组合的方法Flajolet,Szpankowski和谷处理隐藏的模式匹配问题,可以应用到解决固定输出长度和$n\rightarrow\infty$的情况下,通过获得估计熵的矩的后验分布和建立其最小化通过自相关的措施。

英文摘要:

From the output produced by a memoryless deletion channel from a uniformly random input of known length $n$, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that of the uniform prior measures the amount of information about the channel input which is conveyed by the output of length $m$, and it is natural to ask for which outputs this is extremized. This question was posed in a previous work, where it was conjectured on the basis of experimental data that the entropy of the posterior is minimized and maximized by the constant strings $\texttt{000}\ldots$ and $\texttt{111}\ldots$ and the alternating strings $\texttt{0101}\ldots$ and $\texttt{1010}\ldots$ respectively. In the present work we confirm the minimization conjecture in the asymptotic limit using results from hidden word statistics. We show how the analytic-combinatorial methods of Flajolet, Szpankowski and Vallée for dealing with the hidden pattern matching problem can be applied to resolve the case of fixed output length and $n\rightarrow\infty$, by obtaining estimates for the entropy in terms of the moments of the posterior distribution and establishing its minimization via a measure of autocorrelation.

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

↑