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

马氏信源熵近似计算复杂性的一个下界

A Lower Bound on the Complexity of Approximating the Entropy of a Markov Source

Travis Gagie

摘要:

假设,对于任何(k \geq 1),(ε> 0)和足够大的$σ$,我们被给予一个黑盒,该黑盒允许我们在字母表(\{0,.,σ- 1)。即使我们知道源的熵为0或至少为(\log(σ- k)),仍然没有算法在概率远离(1 / 2)的情况下,在对最多((σ- k)^{k / 2 - ε})个字符进行采样后正确地猜测熵。

英文摘要:

Suppose that, for any (k \geq 1), (ε> 0) and sufficiently large $σ$, we are given a black box that allows us to sample characters from a $k$th-order Markov source over the alphabet (\{0, ..., σ- 1\}). Even if we know the source has entropy either 0 or at least (\log (σ- k)), there is still no algorithm that, with probability bounded away from (1 / 2), guesses the entropy correctly after sampling at most ((σ- k)^{k / 2 - ε}) characters.

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

↑