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

i.i.d.的模式。序列及其熵--II:某些分布的界

Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions

Gil I. Shamir

摘要:

序列的模式是整数索引的序列,其中每个索引描述原始序列中相应符号的第一次出现的顺序。在最近的一篇论文中,严格的一般界的模式产生的序列的块熵的独立同分布(i.i.d.)来源派生。本文对独立同分布生成的序列模式的模式块熵提供了精确的近似。均匀分布和单调分布,包括整数分布和几何分布。这些分布的模式块熵的数值界限,即使是非常短的块。即使对于具有无限i.i.d.的分布,也得到了紧界。熵率使用一般的界限和他们的推导技巧的近似。条件指数熵分布在较小的字母表也进行了研究。

英文摘要:

A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of sequences generated by independent and identically distributed (i.i.d.) sources were derived. In this paper, precise approximations are provided for the pattern block entropies for patterns of sequences generated by i.i.d. uniform and monotonic distributions, including distributions over the integers, and the geometric distribution. Numerical bounds on the pattern block entropies of these distributions are provided even for very short blocks. Tight bounds are obtained even for distributions that have infinite i.i.d. entropy rates. The approximations are obtained using general bounds and their derivation techniques. Conditional index entropy is also studied for distributions over smaller alphabets.

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

↑