arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.3735cs.ITmath.IT
收藏

任务编码与Rényi熵率

Codes for Tasks and Rényi Entropy Rate

Christoph Bunte, Amos Lapidoth

摘要:

任务是从有限的任务集合中随机抽取的,并使用固定数量的位来描述。必须执行共享其描述的所有任务。最小$ρ$ -th时刻的执行任务的数量上的上限和下限的推导。关键是一个类似的卡夫不等式分区的有限集。当任务序列是由一个源的一个给定的雷尼熵率的顺序$1/(1+ρ)$和$n$任务共同描述使用$nR$位,它表明,对于$R$大于雷尼熵率,$ρ$阶矩的执行任务的比例$n$可以驱动为1,因为$n$趋于无穷大,对于小于雷尼熵率的$R$,它趋于无穷大。这推广了同一作者最近的IID源的结果。还考虑了直接部分的不匹配版本,其中代码是根据错误的定律设计的。由不匹配引起的惩罚可以用发散度量来表示,Sundaresan在Massey-Arikan猜测问题中扮演了类似的角色。

英文摘要:

A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum $ρ$-th moment of the number of performed tasks are derived. The key is an analog of the Kraft Inequality for partitions of finite sets. When a sequence of tasks is produced by a source of a given Rényi entropy rate of order $1/(1+ρ)$ and $n$ tasks are jointly described using $nR$ bits, it is shown that for $R$ larger than the Rényi entropy rate, the $ρ$-th moment of the ratio of performed tasks to $n$ can be driven to one as $n$ tends to infinity, and that for $R$ less than the Rényi entropy rate it tends to infinity. This generalizes a recent result for IID sources by the same authors. A mismatched version of the direct part is also considered, where the code is designed according to the wrong law. The penalty incurred by the mismatch can be expressed in terms of a divergence measure that was shown by Sundaresan to play a similar role in the Massey-Arikan guessing problem.

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

↑