@article {Boualame202095,
	title = {An Efficient Semi-Algebraic Decoding Algorithm for Golay Code},
	journal = {Communications in Computer and Information Science},
	volume = {1264},
	year = {2020},
	note = {cited By 0},
	pages = {95-102},
	abstract = {In this paper, we propose an algorithm for decoding the QR(23,12,7) code knowing by the binary Golay code. This method never calculates unknown syndromes and does not need the error locator polynomial. Indeed, we use simple parameters to locate the error position. So, to validate the proposed method, all possible error patterns are tested and the proposed decoder correct all of them. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Block codes, Data communication systems, Decoding, Decoding algorithm, Error locator polynomial, Error patterns, Errors, Golay code, Security of data, Unknown syndromes},
	doi = {10.1007/978-3-030-61143-9_8},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097406038\&doi=10.1007\%2f978-3-030-61143-9_8\&partnerID=40\&md5=7ad6a041a67402ca70b0934aed15a68e},
	author = {Boualame, H. and Chana, I. and Belkasmi, M.}
}
@conference {Boualame20181,
	title = {New efficient decoding algorithm of the (17, 9, 5) quadratic residue code},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/COMMNET.2018.8360258},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048326657\&doi=10.1109\%2fCOMMNET.2018.8360258\&partnerID=40\&md5=198217e84a8461108632edc7190041a6},
	author = {Boualame, H. and Chana, I. and Belkasmi, M.}
}
@conference {Boualame2017,
	title = {An efficient soft decision decoding algorithm using cyclic permutations and compact genetic algorithm},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {The compact genetic algorithm cGA is used in this paper to design an efficient soft-decision decoding algorithm, especially for the cyclic codes, because the cGA dramatically reduces the population{\textquoteright}s size and rapidly converges to the optimal solution compared to classical genetic algorithms. Our main contribution is to exploit the cyclic property of cyclic linear codes to reduce the complexity of the decoding process especially in the test sequences generation and re-encoding stage where we use the generator polynomial instead of the generator matrix. The second idea behind our decoding algorithm is the complexity improvement inside of cGA by decreasing the probability vector{\textquoteright}s length, which becomes less than the length of the cGA original one. The experiments were carried out on the most popular cyclic codes, and the results show that the performances of our algorithm are better than some famous decoding algorithms in terms of Bit Error Rate. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843936},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015170559\&doi=10.1109\%2fACOSIS.2016.7843936\&partnerID=40\&md5=249f966f42367ada53bac8892853f1c4},
	author = {Boualame, H. and Tahiri, N. and Chana, I. and Azouaoui, A. and Belkasmi, M.}
}
