Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method
Bouchaib Aylaj, Saïd Nouh, Mostafa Belkasmi, Hamid Zouaki · International Journal of Advanced Computer Science and Applications · 2016
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.