Discrete Entropy

  • José María AmigóEmail author
Part of the Springer Series in Synergetics book series (SSSYN)

From a mathematical point of view, entropy made its first appearance in continuous-time dynamical systems (more exactly, in Hamiltonian flows), and from there it was extended to quantum mechanics by von Neumann, to information theory by Shannon, and to discrete-time dynamical systems by Kolmogorov and Sinai. In all these cases we observe that (i) if the state space is discrete and/or finite (like in quantum mechanics and finite-alphabet information sources), then the evolution is random and (ii) if the evolution is deterministic (like in continuous- and discrete-time dynamical systems), then the state space is infinite. Still today one speaks of random dynamical systems in the first case and of deterministic dynamical systems in the second case. But not all dynamical systems of interest fall under one of the previous categories. An important example of a deterministic physical system where both state space and dynamics are discrete is a digital computer; this entails that any dynamical trajectory in computer becomes eventually periodic–-a well-known effect in the theory and practice of pseudo-random number generation. Dynamical systems with discrete and even with a finite number of states have been considered by a number of authors, in particular in the development of discrete chaos [125]–-an attempt to formalize the idea that maps on finite sets may have different diffusion and mixing properties. From this perspective, it seems desirable to export some concepts and tools from the general theory to this new setting. This is the rationale behind, e.g., the discrete Lyapunov exponent [124, 125].


Lyapunov Exponent Primitive Root Permutation Entropy Random Dynamical System Ordinal Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

  1. 2.
    M. Abraimowitz and I.A. Stegun (Eds.), Handbook of Mathematical Functions. Dover, New York, 1972.Google Scholar
  2. 13.
    J.M. Amigó, L. Kocarev, and J. Szczepanski, Discrete Lyapunov exponent and resistance to differential cryptanalysis, IEEE Transactions on Circuits and Systems II 54 (2007) 882–886.CrossRefGoogle Scholar
  3. 86.
    S.W. Golomb, Bulletin of the American Mathematical Society 70 (1964) 747 (research problem 11).CrossRefMathSciNetGoogle Scholar
  4. 124.
    L. Kocarev and J. Szczepanski, Finite-space Lyapunov exponents and pseudo-chaos, Physical Review Letters 93 (2004) 234101.CrossRefADSGoogle Scholar
  5. 125.
    L. Kocarev, J. Szczepanski, J.M. Amigó, and I. Tomovski, Discrete Chaos – Part I: Theory, IEEE Transactions on Circuits and Systems I 53 (2006) 1300–1309.CrossRefGoogle Scholar
  6. 172.
    J. Piepzryk, T. Hardjorno, and J. Seberry, Fundamentals of Computer Security. Springer Verlag, Berlin, 2003.Google Scholar
  7. 187.
    L.A. Shepp and S.P. Lloyd, Ordered cycle length in a random permutation, Transactions of the American Mathematical Society 121 (1966) 340–357.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.Centro de Investigacion OperativaUniversidad Miguel HernandezElcheSpain

Personalised recommendations