@article {Rkizat2019168,
	title = {A New Quasi-Cyclic Majority Logic Codes Constructed from Disjoint Difference Sets by Genetic Algorithm},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {756},
	year = {2019},
	note = {cited By 0},
	pages = {168-177},
	doi = {10.1007/978-3-319-91337-7_16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047321606\&doi=10.1007\%2f978-3-319-91337-7_16\&partnerID=40\&md5=c0583078d7ef801071c2f7c605348789},
	author = {Rkizat, K. and Nouh, S. and Lahmer, M. and Belkasmi, M.}
}
@conference {Rkizat2017,
	title = {Construction and iterative threshold decoding for low rates Quasi-Cyclic One Step Majority logic decodable codes},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {This paper investigates the construction and iterative threshold decoding of low rate Quasi-Cyclic One Step Majority logic codes based on combinatorial designs. These codes are constructed with two type of difference family: cyclic disjoint difference sets and cyclic disjoint difference family. They can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding (ITD) algorithm. We present an amelioration of ITD algorithm for decoding these codes. This algorithm modification can be applicable for every code rate. The performances of this algorithm for decoding these codes on Additive White Gaussian Noise (AWGN) channel, is investigated. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843944},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015226293\&doi=10.1109\%2fACOSIS.2016.7843944\&partnerID=40\&md5=c6afb690075fcd98594cbdf6ea4475be},
	author = {Rkizat, K. and Lahmer, M. and Belkasmi, M. and Nouh, S.}
}
@conference {Rkizat2015117,
	title = {Iterative threshold decoding of Quasi-Cyclic One Step Majority logic decodable codes},
	booktitle = {Proceedings of the 2015 5th World Congress on Information and Communication Technologies, WICT 2015},
	year = {2015},
	note = {cited By 0},
	pages = {117-122},
	abstract = {This paper presents a new class of Quasi-Cyclic One Step Majority logic codes of 1/2 rate constructed from perfect difference set. Theses codes can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding algorithm. Much of these codes is a subfamily of the LDPC codes and can be decoded using belief propagation algorithm. A comparison between our results and those for LDPC code in terms of BER performance are presented. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WICT.2015.7489656},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979763400\&doi=10.1109\%2fWICT.2015.7489656\&partnerID=40\&md5=c9fdc4ec618d801dc53c49b1b5cec0f5},
	author = {Rkizat, K. and Lahmer, M. and Belkasmi, M.}
}
