arXiv · nlin/0309005
Periodicity of chaotic trajectories in realizations of finite computer precisions and its implication in chaos communications
Abstract
Fundamental problems of periodicity and transient process to periodicity of chaotic trajectories in computer realization with finite computation precision is investigated by taking single and coupled Logistic maps as examples. Empirical power law relations of the period and transient iterations with the computation precisions and the sizes of coupled systems are obtained. For each computation we always find, by randomly choosing initial conditions, a single dominant periodic trajectory which is realized with major portion of probability. These understandings are useful for possible applications of chaos, e.g., chaotic cryptography in secure communication.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Shihong Wang, Weirong Liu, Huaping Lu, Jinyu Kuang, Gang Hu. 2004-02-20. Periodicity of chaotic trajectories in realizations of finite computer precisions and its implication in chaos communications. https://doi.org/10.1142/s0217979204025798. https://searcharxiv.com/abs/nlin/0309005
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.