arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0009084math.PRmath.CO
收藏

关于有限序列复杂度的分布函数

On the Distribution Function of the Complexity of Finite Sequences

Janusz Szczepanski

摘要:

对序列复杂性的研究在数据压缩、随机性检验、信源鉴别等方面有着重要的应用。本文建立了描述随机变量的分布函数的公式,它表示Lempel和Ziv在1976年提出的有限序列的复杂性。我们证明了分布函数以仿射方式依赖于所谓的“精确”序列的概率。

英文摘要:

Investigations of complexity of sequences lead to important applications such as effective data compression, testing of randomness, discriminating between information sources and many others. In this paper we establish formulas describing the distribution functions of random variables representing the complexity of finite sequences introduced by Lempel and Ziv in 1976. We show that the distribution functions depend in an affine way on the probabilities of the so called "exact" sequences.

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

↑