14 Rate-1∕2 Maximum Free Distance Convolutional Codes Complexity Analysis with Chaos-Encrypted Data
Download citation file:
In this paper we address the following question. How much can information complexity be increased via a chaotic encryption and convolutional coding? To address this, the algorithmic complexity of data sequences generated from a cascade of one-stage chaotic cryptosystem and a one-stage convolutionally encoding mechanism is examined. An algorithm that evaluates the efficiency and performance of this mechanism for a secure digital communication is designed. Special attention was paid to the algorithmic complexity of computing information for an entire class of rate-1∕2 encoders. Numerical evidence indicates algorithmic complexity associated with the chaotic-encrypted convolutionally-encoded data increases along with the increase of the error correcting capacity of the decoder.