Journal ArticleDOI
On the Complexity of Finite Sequences
A. Lempel,Jacob Ziv +1 more
Reads0
Chats0
TLDR
A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented, related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated.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.read more
Citations
More filters
Journal ArticleDOI
Quantifying the complexity of the delayed logistic map
TL;DR: It is shown that the time series generated from the nonlinear delayed logistic map can present zero missing or forbidden patterns, i.e. all possible ordinal patterns are realized into orbits.
Journal ArticleDOI
Secure Strategy for OFDM-PON Using Digital Chaos Algorithm With Fixed-Point Implementation
TL;DR: The experimental results indicate that the proposed scheme for security improvement in the orthogonal frequency division multiplexing (OFDM) passive optical network suggests an effective and promising solution to meet the demands for low implementation complexity and high security level.
Proceedings ArticleDOI
Comparison of data mining techniques applied to fetal heart rate parameters for the early identification of IUGR fetuses
TL;DR: This study searches for discriminating Normal and Intra Uterine Growth Restricted (IUGR) fetuses by applying data mining techniques to FHR parameters, obtained from recordings in a population of 122 fetuses (61 healthy and 61 IUGRs), through standard CTG non-stress test.
Book ChapterDOI
Ziv-Lempel complexity for periodic sequences and its cryptographic application
TL;DR: This paper considers the Ziv-Lempel complexity for periodic sequences as well as for pseudorandom number sequences and examines its cryptographic significance and compares it with other complexity measures such as the linear complexity.
Journal ArticleDOI
Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets.
TL;DR: The overall combination of methods in this paper is useful for clustering protein families into subtypes based on solely protein sequence information and is also flexible and computationally fast because it does not require multiple alignment of sequences.
References
More filters
Journal ArticleDOI
Three approaches to the quantitative definition of information
TL;DR: In this article, three approaches to the quantitative definition of information are presented: information-based, information-aware and information-neutral approaches to quantifying information in the context of information retrieval.
Journal ArticleDOI
The definition of random sequences
TL;DR: It is shown that the random elements as defined by Kolmogorov possess all conceivable statistical properties of randomness and can equivalently be considered as the elements which withstand a certain universal stochasticity test.
Journal ArticleDOI
Process complexity and effective random tests
TL;DR: A variant of the Kolmogorov concept of complexity which yields a common theory of finite and infinite random sequences and some concepts of effective tests which are proved to be equivalent are established.
Journal ArticleDOI
Information-Theoretic Limitations of Formal Systems
TL;DR: An attempt is made to apply information-theoretic computational complexity to meta-mathematics by measuring the difficulty of proving a given set of theorems, in terms of the number of bits of axioms that are assumed, and the size of the proofs needed to deduce the theoremic proofs.