1976
DOI: 10.1109/tit.1976.1055501
|View full text |Cite
|
Sign up to set email alerts
|

On the Complexity of Finite Sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

12
1,649
0
26

Year Published

2001
2001
2015
2015

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 2,321 publications
(1,687 citation statements)
references
References 4 publications
12
1,649
0
26
Order By: Relevance
“…This is an alternative to the analysis based on firing rate methods. It was shown that Lempel-Ziv complexity as defined in Lempel and Ziv (1976) can be used successfully as such an estimator (Amigó et al 2004).…”
Section: The Entropy Rate and The Lempel-ziv Estimatormentioning
confidence: 99%
See 1 more Smart Citation
“…This is an alternative to the analysis based on firing rate methods. It was shown that Lempel-Ziv complexity as defined in Lempel and Ziv (1976) can be used successfully as such an estimator (Amigó et al 2004).…”
Section: The Entropy Rate and The Lempel-ziv Estimatormentioning
confidence: 99%
“…The entropy rate of a locally stationary neural signal at time t is then estimated in the time window [t, t + T ]. We will use for this purpose the normalized Lempel-Ziv 76 complexity (Lempel and Ziv 1976), a technique we applied and tested in Amigó et al (2004). Precisely, the explicit analysis of locally stationary neural signals (along with the introduction of RMI) is perhaps the most important aspect of this article.…”
Section: Introductionmentioning
confidence: 99%
“…In addition, time series need to be stationary, something that is usually not true with physiological signals. With these limitations in mind, Lempel-Ziv Complexity (LZC), a complexity estimator introduced by Lempel and Ziv (1976), has been proposed for EEG/MEG signals analysis. The LZC is a metric that, similar to the algorithmic complexity, reflects the number of distinct substrings and the rate of their recurrence along the given sequence (Radhakrishnan & Gangadhar, 1998).…”
Section: Introductionmentioning
confidence: 99%
“…If the length of the sequence is n and the number of different symbols is α, it has been proved (Lempel and Ziv, 1976) that the upper bound of c(n) is given by:…”
mentioning
confidence: 99%
“…In particular, the complexity as defined by Lempel and Ziv (1976) counts the number of new patterns along a discrete sequence, time series or, in more physical terms, digital signal. A related quantity, the normalized complexity, provides a lower bound for the compression ratio of the signal by optimal coding (Ziv and Lempel, 1978), so that the higher the normalized complexity of a discrete signal, the more information it conveys.…”
Section: Introductionmentioning
confidence: 99%