COMPLEXITY OF FINITE SEQUENCES
COMPLEXITY OF FINITE SEQUENCES
复制标题
DOI：
10.1109/tit.1976.1055501
复制
发表时间：
1976-01-01
影响因子：
2.5
通讯作者：
ZIV, J
中科院分区：
文献类型：
--
作者：
LEMPEL, A;ZIV, J
提出了一种评价有限序列复杂性(随机性)问题的新方法。所提出的复杂性度量与假定生成给定序列的自定界生产过程中的步骤数有关。它还与不同的子串的数量和它们在序列中的出现速度有关。讨论了所提出的度量的派生性质，并结合其他已确立的复杂性标准进行了激励。
A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented. The proposed complexity measure is related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated. It is further related to the number of distinct substrings and the rate of their occurrence along the sequence. The derived properties of the proposed measure are discussed and motivated in conjunction with other well-established complexity criteria.