This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Jan 1976
Volume: 22,
Issue: 1
On page(s): 75- 81
ISSN: 0018-9448
Posted online: 2003-01-06 16:42:57.0
Abstract
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.
Index Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
