0
Rate-1∕2 Maximum Free Distance Convolutional Codes Complexity Analysis with Chaos-Encrypted Data

Excerpt

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.

  • Abstract
  • Introduction
  • Chaotic Encryption and Convolutional Coding
  • Convolutional Coding Theory
  • Best Rate-1∕2 Convolutional Codes Algorithmic Complexity
  • Complexity Analysis
  • Conclusion
  • References

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In