Coding scheme based on chaos synchronization from noninvertible maps

This paper deals with a new coding scheme in digital implementation for sec ure communications. It is based on specific dynamic features generated by n oninvertible maps. The main results are a global chaos synchronization, an exact synchronization without a residual error generated by the classical m ethods, a robustness with respect to channel disturbances. Chaos synchroniz ation is obtained by introducing an observer model and the classical result s of the control theory. Besides, this coding scheme introduces several "ke ys" required for decoding the initial information, which improves the secur ity of communications.