Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method

Abstract

In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an integer). This method searches circulant matrices in order to find the good quasi-cyclic code (QCC) having the largest minimum distance. A modified simulated annealing algorithm is used as an evaluator tool of the minimum distance of the obtained QCC codes. Based on this method we found 16 good quasi-cyclic codes with rates (1/2, 2/3 and 3/4), their estimated minimum distance reaches the lower bounds of codes considered to be the better linear block codes in Brouwer’s database.

Authors and Affiliations

Bouchaib AYLAJ, Said NOUH, Mostafa BELKASMI, Hamid ZOUAKI

Keywords

Related Articles

Cloud Server Security using Bio-Cryptography

Data security is becoming more important in cloud computing. Biometrics is a computerized method of identifying a person based on a physiological characteristic. Among the features measured are our face, fingerprints, ha...

Three Layer Hierarchical Model for Chord

Increasing popularity of decentralized Peer-to-Peer (P2P) architecture emphasizes on the need to come across an overlay structure that can provide efficient content discovery mechanism, accommodate high churn rate and ad...

An Integrated Architectural Clock Implemented Memory Design Analysis

Recently Low power consumption and Custom Memory design is major issue for embedded designer. Micro wind and Xilinx simulator implements SRAM design architecture and performs efficient simulation. These simulators implem...

The Utilization of Feature based Viola-Jones Method for Face Detection in Invariant Rotation

Faces in an image consists of complex structures in object detection. The components of a face, which includes the eyes, nose and mouth of a person differs from that of ordinary objects, thus making face detecting a com...

Genetic Algorithm for Data Exchange Optimization

Dynamic architectures have emerged to be a promising implementation platform to provide flexibility, high performance, and low power consumption for computing devices. They can bring unique capabilities to computational...

Download PDF file
  • EP ID EP101842
  • DOI 10.14569/IJACSA.2016.070909
  • Views 86
  • Downloads 0

How To Cite

Bouchaib AYLAJ, Said NOUH, Mostafa BELKASMI, Hamid ZOUAKI (2016). Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method. International Journal of Advanced Computer Science & Applications, 7(9), 63-68. https://europub.co.uk./articles/-A-101842