考虑偏差的猜测的非渐近基本极限
Non-Asymptotic Fundamental Limits of Guessing Subject to Distortion
摘要:
本文研究了Arikan和Merhav提出的受失真影响的猜测问题。虽然以前的研究主要关注的是渐近分析,我们主要关注的是非渐近分析。我们证明了在没有边信息的情况下猜测次数的矩的非渐近可解性和逆界。具有边信息)通过使用基于Rényi熵的量(相应地,Arimoto-Rényi条件熵)。此外,我们引入了错误概率,并显示类似的结果。此外,从我们的界限,我们得到了一个单字母的表征的渐近指数的猜测时刻的平稳无记忆源。
英文摘要:
This paper investigates the problem of guessing subject to distortion, which was introduced by Arikan and Merhav. While the primary concern of the previous study was asymptotic analysis, our primary concern is non-asymptotic analysis. We prove non-asymptotic achievability and converse bounds of the moment of the number of guesses without side information (resp. with side information) by using a quantity based on the Rényi entropy (resp. the Arimoto-Rényi conditional entropy). Also, we introduce an error probability and show similar results. Further, from our bounds, we derive a single-letter characterization of the asymptotic exponent of guessing moment for a stationary memoryless source.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。