@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.}
}
@article {Aylaj2018982,
	title = {Construction of regular quasi cyclic-low density parity check codes from cyclic codes},
	journal = {ARPN Journal of Engineering and Applied Sciences},
	volume = {13},
	number = {3},
	year = {2018},
	pages = {982-989},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85042232450\&partnerID=40\&md5=28e1cbb2eff93cd7408cd2458e5dd3b4},
	author = {Aylaj, B. and Belkasmi, M. and Nouh, S. and Zouaki, H.}
}
@article {Aylaj2018982,
	title = {Construction of regular quasi cyclic-low density parity check codes from cyclic codes},
	journal = {ARPN Journal of Engineering and Applied Sciences},
	volume = {13},
	number = {3},
	year = {2018},
	note = {cited By 0},
	pages = {982-989},
	abstract = {Low Density Parity Check Codes (LDPC) are a class of linear error-correcting codes which have shown ability to approach or even to reach the capacity of the transmission channel. This class of code approaches asymptotically the fundamental limit of information theory more than the Turbo Convolutional codes. It{\textquoteright}s ideal for long distance transmission satellite, mobile communications and it{\textquoteright}s also used in storage systems. In this paper, a new method for constructing quasicyclic low density parity-check (QC-LDPC) codes derived from cyclic codes is presented. The proposed method reduces the incidence vectors, by eliminating the conjugates lines in parity-check matrix of the derived cyclic code to construct circulant shifting sub-matrices. In the end, this method produces a large class of regular LDPC codes of quasi-cyclic structure having very low density, high coding rates and Tanner graphs which have no short cycles with girth of at least 6. Performance with computer simulations are also shown in this work for some constructed codes. {\textcopyright} 2006-2018 Asian Research Publishing Network (ARPN).},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85042232450\&partnerID=40\&md5=28e1cbb2eff93cd7408cd2458e5dd3b4},
	author = {Aylaj, B. and Belkasmi, M. and Nouh, S. and Zouaki, H.}
}
@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.}
}
@article {Nouh2013201,
	title = {Decoding of block codes by using genetic algorithms and permutations set},
	journal = {International Journal of Communication Networks and Information Security},
	volume = {5},
	number = {3},
	year = {2013},
	note = {cited By 1},
	pages = {201-209},
	abstract = {Recently Genetic algorithms are successfully used for decoding some classes of error correcting codes. For decoding a linear block code C, these genetic algorithms computes a permutation p of the code generator matrix depending of the received word. Our main contribution in this paper is to choose the permutation p from the automorphism group of C. This choice allows reducing the complexity of re-encoding in the decoding steps when C is cyclic and also to generalize the proposed genetic decoding algorithm for binary nonlinear block codes like the Kerdock codes. In this paper, an efficient stop criterion is proposed and it reduces considerably the decoding complexity of our algorithm. The simulation results of the proposed decoder, over the AWGN channel, show that it reaches the error correcting performances of its competitors. The study of the complexity shows that the proposed decoder is less complex than its competitors that are based also on genetic algorithms.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84890158477\&partnerID=40\&md5=b6dcd56b7afd948385db98325525744e},
	author = {Nouh, S. and Chana, I. and Belkasmi, M.}
}
@conference {Askali2012318,
	title = {An efficient method to find the minimum distance of linear block codes},
	booktitle = {Proceedings of 2012 International Conference on Multimedia Computing and Systems, ICMCS 2012},
	year = {2012},
	note = {cited By 1},
	pages = {318-324},
	doi = {10.1109/ICMCS.2012.6320261},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869794196\&doi=10.1109\%2fICMCS.2012.6320261\&partnerID=40\&md5=39536ce39eb94470202c180890ae28d0},
	author = {Askali, M. and Nouh, S. and Belkasmi, M.}
}
