@article { ISI:000391110500010,
	title = {Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method},
	journal = {INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS},
	volume = {7},
	number = {9},
	year = {2016},
	month = {SEP},
	pages = {63-68},
	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{\textquoteright}s database.},
	issn = {2158-107X},
	author = {Aylaj, Bouchaib and Belkasmi, Mostafa and Nouh, Said and Zouaki, Hamid}
}
@conference { ISI:000310353000141,
	title = {An Efficient method to find the Minimum Distance of Linear Block Codes},
	booktitle = {2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2012},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Tangiers, MOROCCO, MAY 10-12, 2012},
	pages = {773-779},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Finding the minimum distance of linear codes is in general a NP-hard problem, we propose an efficient algorithm to attack this problem. The principle of this approach is to search code words locally around the all-zero code word perturbed by a level of noise magnitude, in other words the maximum of noise that can be corrected by a Soft-In decoder, anticipating that the resultant nearest non-zero code words will most likely contain the minimum Hamming weight code word, whose Hamming weight is equal to the minimum distance of the linear code. A numerous results prove that the proposed algorithm is valid for general linear codes and it is very fast comparing to all others known techniques, therefore it is a good tool for computing. Comparing to Joanna{\textquoteright}s works, we proof that our algorithm has a low complexity with a fast time of execution. For some linear RQs, QDCs and BCHs codes with unknown minimum distance, we give a good estimation (true) of the minimum distance where the length is less than 439.},
	isbn = {978-1-4673-1520-3},
	author = {Askali, Mohamed and Nouh, Said and Belkasmi, Mostafa},
	editor = {Essaaidi, M and Zaz, Y}
}
