Orbit complexity and data compression

DOI10.3934/DCDS.2001.7.477MaRDI QIDQ5936431zbMATH OpenOpenAlexFDO

Authors Stefano Galatolo

Publication date 2 July 2001

Published in Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/dcds.2001.7.477

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Symbolic dynamics (37B10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Information of sequences and applications
• Dynamical systems and computable information
• Algorithmic complexity of points in dynamical systems
• scientific article; zbMATH DE number 2182449
• Information and dynamical systems: A concrete measurement on sporadic dynamics

Cited in

(10)

• Compression and diffusion: a joint approach to detect complexity.
• Computational information for the logistic map at the chaos threshold
• Compressibility, laws of nature, initial conditions and complexity
• Dynamical systems and computable information
• Detecting regular dynamics from time series using permutations slopes
• Algorithmic complexity of points in dynamical systems
• Orbit complexity by computable structures
• Optimal Information Measures for Weakly Chaotic Dynamical Systems
• Information and dynamical systems: A concrete measurement on sporadic dynamics
• Information of sequences and applications

This page was built for publication: Orbit complexity and data compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936431)