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

Intelligent Collaborative Quality Assurance System for Wind Turbine Supply Chain Management

To determine the root causes or sources of variance of bad quality in supply chains is usually more difficult because multiple parties are involved in the current global manufacturing environment. Each component within a...

Improving DNA Computing Using Evolutionary Techniques

the field of DNA Computing has attracted many biologists and computer scientists as it has a biological interface, small size and substantial parallelism. DNA computing depends on DNA molecules’ biochemical reactions whi...

Evaluation of OLSR Protocol Implementations using Analytical Hierarchical Process (AHP)

Adhoc networks are part of IEEE 802.11 Wireless LAN Standard also called Independent Basic Service Set (IBSS) and work as Peer to Peer network by default. These work without the requirement of an Infrastructure (such as...

Design of an Error Output Feedback Digital Delta Sigma Modulator with In–Stage Dithering for Spur–Free Output Spectrum

Digital Delta Sigma Modulator (DDSM) is responsible for generation of spurious tones at the output of fractional n frequency synthesizer due their inherent periodicity. This results in an impure output spectrum of freque...

Design of a Microstrip Patch Antenna with High Bandwidth and High Gain for UWB and Different Wireless Applications

We propose square shape patch antenna in this research work. Focus of the work is to obtain large bandwidth with compact ground plane for wireless applications. The proposed antenna is designed using dielectric material...

Download PDF file
  • EP ID EP101842
  • DOI 10.14569/IJACSA.2016.070909
  • Views 107
  • 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