@article {Labghough2018200,
	title = {A closed form expression for the bit error probability for majority logic decoding of CSOC codes over ΓΓ channels},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {735},
	year = {2018},
	pages = {200-210},
	doi = {10.1007/978-3-319-76354-5_18},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85044029464\&doi=10.1007\%2f978-3-319-76354-5_18\&partnerID=40\&md5=ccb2b721b8e8c6619ba59f4805aaab19},
	author = {Labghough, S. and Ayoub, F. and Belkasmi, M.}
}
@conference {ElMouaatamid20181,
	title = {Construction and decoding of OSMLD codes derived from unital and oval designs},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-7},
	doi = {10.1109/COMMNET.2018.8360280},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048321116\&doi=10.1109\%2fCOMMNET.2018.8360280\&partnerID=40\&md5=238e55fa6938985018e8315edfbc71f3},
	author = {El Mouaatamid, O. 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},
	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.}
}
@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 {Khelifa2017937,
	title = {Constructing accurate and robust HMM/GMM models for an Arabic speech recognition system},
	journal = {International Journal of Speech Technology},
	volume = {20},
	number = {4},
	year = {2017},
	note = {cited By 0},
	pages = {937-949},
	abstract = {Conventional Hidden Markov Model (HMM) based Automatic Speech Recognition (ASR) systems generally utilize cepstral features as acoustic observation and phonemes as basic linguistic units. Some of the most powerful features currently used in ASR systems are Mel-Frequency Cepstral Coefficients (MFCCs). Speech recognition is inherently complicated due to the variability in the speech signal which includes within- and across-speaker variability. This leads to several kinds of mismatch between acoustic features and acoustic models and hence degrades the system performance. The sensitivity of MFCCs to speech signal variability motivates many researchers to investigate the use of a new set of speech feature parameters in order to make the acoustic models more robust to this variability and thus improve the system performance. The combination of diverse acoustic feature sets has great potential to enhance the performance of ASR systems. This paper is a part of ongoing research efforts aspiring to build an accurate Arabic ASR system for teaching and learning purposes. It addresses the integration of complementary features into standard HMMs for the purpose to make them more robust and thus improve their recognition accuracies. The complementary features which have been investigated in this work are voiced formants and Pitch in combination with conventional MFCC features. A series of experimentations under various combination strategies were performed to determine which of these integrated features can significantly improve systems performance. The Cambridge HTK tools were used as a development environment of the system and experimental results showed that the error rate was successfully decreased, the achieved results seem very promising, even without using language models. {\textcopyright} 2017, Springer Science+Business Media, LLC.},
	doi = {10.1007/s10772-017-9456-7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029588089\&doi=10.1007\%2fs10772-017-9456-7\&partnerID=40\&md5=2479bd9e84585d976f41dd5488eb12c2},
	author = {Khelifa, M.O.M. and Elhadj, Y.M. and Abdellah, Y. 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.}
}
@article {Labbi201645,
	title = {Cryptographic algorithm approach for low cost RFID systems},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {cited By 0},
	pages = {45-54},
	abstract = {Today the security of RFID systems is a very important issue especially for low cost RFID tags. Then, it is difficult for several researchers to adopt a strong encryption algorithm due to the extremely limited computational, storage and communication abilities of the tag. So, the priority in RFID systems is to ensure the integrity, confidentiality and authentication of messages using different algorithms (such as encryption and hashing algorithm). In this paper, we propose a lightweight symmetric key encryption approach that includes integrity as part of the encryption process in order to meet the resource limitations of low cost RFID tags. Furthermore we do not need to use separate hash functions to verify message integrity, thus leading to increase the computational efficiency of the system. {\textcopyright} Springer International Publishing Switzerland 2016.},
	doi = {10.1007/978-3-319-30301-7_6},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964556474\&doi=10.1007\%2f978-3-319-30301-7_6\&partnerID=40\&md5=f73dc7340fe5d1492eb5cf9011c70a9e},
	author = {Labbi, Z. and Maarof, A. and Senhadji, M. and Belkasmi, M.}
}
