| Contents |
| Recent results show that there is a close relation between the Kolmogorov-
Sinai entropy and the relatively new concept of Permutation entropy.
Here we discuss these results in a broader framework. In particular,
we show that under certain separation conditions the distribution of ordinal patterns, which
describe the up and down in a system, is sufficient for determining the
Kolmogorov-Sinai entropy. Moreover, we adress methods of estimatiing Kolmogorov-Sinai entropy on the base of the given approach and compare them with known methods. |
|