Orbit complexity and data compression

被引：13

作者：

Galatolo, S ^{[1
]}

机构：

[1] Univ Pisa, Dipartimento Matemat, I-56127 Pisa, Italy

来源：

DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS | 2001年 / 7卷 / 03期

关键词：

topological dynamical systems; information; coding; entropy; orbit complexity;

D O I：

10.3934/dcds.2001.7.477

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We consider data compression algorithms as a tool to get an approximate measure for the quantity of information contained in a string. By this it is possible to give a notion of orbit complexity for topological dynamical systems. In compact ergodic dynamical systems, entropy is almost everywhere equal to orbit complexity. The use of compression algorithms allows a direct estimation of the information content of the orbits.

引用

页码：477 / 486

页数：10

共 18 条

[11] SPORADICITY - BETWEEN PERIODIC AND CHAOTIC DYNAMICAL BEHAVIORS [J].