Permutations and the kolmogorov-sinai entropy

Karsten Keller*

*Corresponding author for this work
13 Citations (Scopus)


This paper provides a way for determining the Kolmogorov-Sinai entropy of time-discrete dynamical systems on the base of quantifying ordinal patterns obtained from a finite set of observables. As a consequence, it is shown that the Kolmogorov-Sinai entropy is bounded from above by a quantity which generalizes the concept of permutation entropy. In this framework, the determination of the Kolmogorov-Sinai entropy of a multidimensional system by use of only a single one-dimensional observable and Takens' embedding theorem is discussed.

Original languageEnglish
JournalDiscrete and Continuous Dynamical Systems
Issue number3
Pages (from-to)891-900
Number of pages10
Publication statusPublished - 01.03.2012


Dive into the research topics of 'Permutations and the kolmogorov-sinai entropy'. Together they form a unique fingerprint.

Cite this