期刊
PHYSICS LETTERS A
卷 355, 期 1, 页码 27-31出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.physleta.2006.01.093
关键词
chaotic maps; order patterns; permutation entropy; discrete Lyapunov exponent; chaotic cryptography
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据