ABSTRACT
This chapter reviews how Kalman embedded a prescribed Markov information source into chaotic dynamics of the piecewise-linear-monotonic (PLM) Markov onto map and review recently improved Kalman's embedding procedure by using the PLM onto map with the minimum number of subintervals. Many communication systems based on chaotic phenomena have been recently proposed. Some of these attempts, however, have led many chaos researchers to mistakenly overemphasize the role of chaotic phenomena in communication systems. This in turn has led to the rebuttal of chaotic methods by researchers in existing digital communication systems. One of the main reasons for this is that most of these systems have been based on a chaotic real-valued orbit itself rather than its binary version. Sequences of random numbers generated by a Markov chain are discussed as candidates of spreading sequences for Code Division Multiple Access, running-key sequences in the chaotic encryption systems.
