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

 Dynamics of Mandelbrot set with Transcendental Function

 These days Mandelbrot set with transcendental function is an interesting area for mathematicians. New equations have been created for Mandelbrot set using trigonometric, logarithmic and exponential functions. Earli...

Stabilizing Average Queue Length in Active Queue Management Method

This paper proposes the Stabilized (DGRED) method for congestion detection at the router buffer. This method aims to stabilize the average queue length between allocated minthre_shold and doublemaxthre_shold positions to...

Developing a Candidate Registration System for Zambia School Examinations using the Cloud Model

Cloud computing has in the recent past gained a lot of ground in this digital age. The use of cloud technologies in business has broken barriers in sharing information making the world one big global village. Regardless...

Applicability of the Maturity Model for IT Service Outsourcing in Higher Education Institutions

Outsourcing is a strategic option which complements IT services provided internally in organizations. This study proposes the applicability of a new holistic maturity model based on standards ISO/IEC 20000 and ISO/IEC 38...

Improve Query Performance On Hierarchical Data. Adjacency List Model Vs. Nested Set Model

Hierarchical data are found in a variety of database applications, including content management categories, forums, business organization charts, and product categories. In this paper, we will examine two models deal wit...

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