Order patterns and chaos

被引：84

作者：

Amigo, JM ^{[1
]}

Kocarev, L

Szczepanski, J

机构：

[1] Univ Miguel Hernandez, Ctr Invest Operat, E-03202 Elche, Spain

[2] Univ Calif San Diego, Inst Nonlinear Sci, La Jolla, CA 92093 USA

[3] Polish Acad Sci, Inst Fundamental Technol Res, PL-00049 Warsaw, Poland

来源：

PHYSICS LETTERS A | 2006年 / 355卷 / 01期

基金：

美国国家科学基金会;

关键词：

chaotic maps; order patterns; permutation entropy; discrete Lyapunov exponent; chaotic cryptography;

D O I：

10.1016/j.physleta.2006.01.093

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

Chaotic maps can mimic random behavior in a quite impressive way. In particular, those possessing a generating partition can produce any symbolic sequence by properly choosing the initial state. We study in this Letter the ability of chaotic maps to generate order patterns and come to the conclusion that their performance in this respect falls short of expectations. This result reveals some basic limitation of a deterministic dynamic as compared to a random one. This being the case, we propose a non-statistical test based on 'forbidden' order patterns to discriminate chaotic from truly random time series with, in principle, arbitrarily high probability. Some relations with discrete chaos and chaotic cryptography are also discussed. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：27 / 31

页数：5

共 8 条

[1] The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems [J].

Amigó, JM ;

Kennel, MB ;

Kocarev, L .

PHYSICA D-NONLINEAR PHENOMENA, 2005, 210 (1-2) :77-95

[2] Entropy of interval maps via permutations [J].

Bandt, C ;

Keller, G ;

Pompe, B .

NONLINEARITY, 2002, 15 (05) :1595-1602

[3]

COLLET P, 1997, ITERATED MAPS INTERV

[4] Finite-space Lyapunov exponents and pseudochaos [J].

Kocarev, L ;

Szczepanski, J .

PHYSICAL REVIEW LETTERS, 2004, 93 (23)

[5]

KOCAREV L, IN PRESS DISCRETE 1

[6] Permutations and topological entropy for interval maps [J].

Misiurewicz, M .

NONLINEARITY, 2003, 16 (03) :971-976

[7]

PETERSEN K, 1983, ERGODIC THEORY

[8] Cryptographically secure substitutions based on the approximation of mixing maps [J].

Szczepanski, J ;

Amigó, JM ;

Michalek, T ;

Kocarev, L .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2005, 52 (02) :443-453

← 1 →