QUASI-CHAOTIC CODING OVER GF(q)

PETRUZZI, D. M.; CASTIÑEIRA MOREIRA, J.; LEVIN, D. G.

IEEE TRANSACTIONS ON COMMUNICATIONS

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC

Año: 2006 vol. 54 p. 462 - 468

0090-6778

In this paper, we present quasi-chaotic (QC) schemesfor secure digital communication systems, designed over Galoisfields (GFs) with optimal randomness properties. Schemes withthe maximum-output sequence length (all-zero input response) arepresented for different GFs. Two coefficients are used to quantitativelymeasure the proximity of the behavior of these schemes withrespect to the ideal white noise behavior. The proposed schemesoutperform those presented by Frey in his paper, and achieve theoptimal QC properties available for a given chaotic digital scheme.The proposed schemes have also a very little loss in bit-error rateperformance so that they are a good alternative to the design ofsystems for which encryption and error correction are importantjoint goals. They can be implemented with time-variant coefficientsin order to highly improve the cryptographic properties ofthe transmission.