@conference {Berkani2016623,
	title = {Compact Genetic Algorithms with larger tournament size for soft-decision decoding},
	booktitle = {International Conference on Intelligent Systems Design and Applications, ISDA},
	volume = {2016-June},
	year = {2016},
	note = {cited By 0},
	pages = {623-628},
	abstract = {The standard compact Genetic Algorithm uses competition between two individuals for which we calculate the objective function and the winner will be the one who gives the best value of this function. This work presents a new approach of compact Genetic Algorithm that uses more than just two vectors of competition; it introduces tournament selection with larger size using mutation. We apply this algorithm to solve dual domain soft-decision decoding problem. A performance study of the new decoder will be done and the results will be compared to another compact genetic decoder that uses higher selection pressure with randomly generated individuals. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISDA.2015.7489189},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978427919\&doi=10.1109\%2fISDA.2015.7489189\&partnerID=40\&md5=0b021f10df757f48d5d54c2fa5de9db2},
	author = {Berkani, A.a and Azouaoui, A.b and Belkasmi, M.a and Aylaj, B.b}
}
@conference {Azougaghe2016421,
	title = {An efficient algorithm for data security in Cloud storage},
	booktitle = {International Conference on Intelligent Systems Design and Applications, ISDA},
	volume = {2016-June},
	year = {2016},
	note = {cited By 0},
	pages = {421-427},
	abstract = {Cloud computing has now become a major trend, it is a new data hosting technology that is Very popular in recent years thanks to the amortization of costs it induces to companies. In this paper we present the major security issues in cloud computing and we also propose a simple, secure, and privacy-preserving architecture for inter-Cloud data sharing based on an encryption/decryption algorithm which aims to protect the data stored in the cloud from the unauthorized access. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISDA.2015.7489267},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978374763\&doi=10.1109\%2fISDA.2015.7489267\&partnerID=40\&md5=eb13454b1c8384bc8bc11182c4419af5},
	author = {Azougaghe, A.a and Kartit, Z.b and Hedabou, M.a and Belkasmi, M.a and El Marraki, M.b}
}
@conference {Gueddah2016,
	title = {The filtered combination of the weighted edit distance and the Jaro-Winkler distance to improve spellchecking Arabic texts},
	booktitle = {Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA},
	volume = {2016-July},
	year = {2016},
	note = {cited By 0},
	abstract = {The digital environments for human learning have been much evolving thanks to the incredible progress of information technologies. This is particularly the case for automatic correction of spelling errors requested by a large majority of people nowadays. Almost all of the current spellcheckers are semiautomatic, and they enable users to find the good solution for a committed error. The major shortcoming of the existing metric methods of correction lies in the bad scheduling of the solutions suggested to the spellchecking out of context of a detected error. To overcome this limitation, we have developed several approaches which suggest probability costs estimated from a learning test. It is attributed in various editing operations during calculating measure of similarity, case of the edit distance. The idea developed in this work was to know how to efficiently weigh these editing operations without resorting to a phase of learning. This is based only on the proximity and the similarity between Arabic keyboard keys. Additionally, we have suggested combining this measure with the distance of Jaro-Winkler in order to better filter, refine and weigh certain solutions compared to others. The experimental results stem from tests conducted on errors committed in a learning corpus, trying to validate the choices of conception and to prove the interest of both approaches. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/AICCSA.2015.7507128},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84980349949\&doi=10.1109\%2fAICCSA.2015.7507128\&partnerID=40\&md5=4274ec18faa9128a9efb4ef1c135fe25},
	author = {Gueddah, H.a and Yousfi, A.b and Belkasmi, M.a}
}
@article {Naamane2016215,
	title = {A new semi-analytical performance prediction of a digital communication system},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {cited By 0},
	pages = {215-223},
	abstract = {This paper proposes a new semi-analytical method for estimating the error probability for any digital communication system. We show that the problem of the error probability estimation is equivalent to estimating the conditional probability density function (pdfs) of soft receiver outputs. The proposed method uses Fast Fourier transform inversion for predicting the pdf. Furthermore, we applied Bootstrap criterion for selecting the optimum smoothing parameter which makes this method more accurate. Simulation results have shown that the obtained error probability with the new approach is close to that measured by Monte-Carlo simulation method. {\textcopyright} Springer International Publishing Switzerland 2016.},
	doi = {10.1007/978-3-319-30301-7_23},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964523339\&doi=10.1007\%2f978-3-319-30301-7_23\&partnerID=40\&md5=23ff7e542019ffa42bc1eaf2b91eefd3},
	author = {Naamane, F.E.a and Et-tolba, M.b and Belkasmi, M.a}
}
@conference {Yatribi2015,
	title = {Construction of cyclic one-step majority-logic decodable codes using genetic algorithms},
	booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {In [6], a construction of cyclic one-step majority-logic decodable codes based on idempotent polynomials is given. However, the search for the feasible Parity-Check Idempotent runs through all possible combinations of cyclotomic cosets modulo n, satisfying some algebraic constraints, consequently, increasing the code length may result in very large dimension space search, and the search for the solution becomes more difficult. In this paper, we propose a Genetic Algorithm that aimes to construct new moderate and high lengths Binary Cyclic OSMLD codes, considered as LDPC codes, with high correction capacities. Our construction is very efficient and provide codes with high lenghts and high rates. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WINCOM.2015.7381301},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965037029\&doi=10.1109\%2fWINCOM.2015.7381301\&partnerID=40\&md5=81a1ec4d5126eb8f485411ea3f2f1a37},
	author = {Yatribi, A.a and Ayoub, F.b and Belkasmi, M.a}
}
@conference {Chanyour201557,
	title = {Secure sparse network coding for reliable routing in large scale DTMN},
	booktitle = {Proceedings - 2015 3rd International Workshop on RFID and Adaptive Wireless Sensor Networks, RAWSN 2015 - In conjunction with the International Conference on NETworked sYStems, NETYS 2015},
	year = {2015},
	note = {cited By 0},
	pages = {57-62},
	abstract = {Security issue occupies an important part in all communication system and especially for new generation networks. Among these networks, we find Delay Tolerant Mobile Networks (DTMNs) which are a class of useful but challenging networks. Combining Network Coding (NC) and clustering for routing in such networks gives more efficiency and copes with routing reliability problem among large scale networks. Our work{\textquoteright}s concern is to build a secure network coding scheme in the presence of eavesdroppers in large-scale DTMNs. Therefore, we used a cluster based routing protocol dedicated to DTMN specificities. In addition, we used Sparse Random Linear Network Coding (SRLNC) to feat low computational capabilities requirement in such networks. Furthermore, we addressed the packets retransmission decision problem for SRLNC with a fair trade-off throughput/overhead. The results are very encouraging and the proposed routing scheme has the advantage to be reliable as well as secure for large scale DTMN. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/RAWSN.2015.7173280},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84966552832\&doi=10.1109\%2fRAWSN.2015.7173280\&partnerID=40\&md5=3d0cbb4c0c91e93d68d64811357a6f36},
	author = {Chanyour, T.a and Saadane, R.b and Belkasmi, M.a}
}
@article {Naamane2015,
	title = {A semi-analytical performance prediction of a digital communication system using Fourier transform inversion},
	journal = {Eurasip Journal on Wireless Communications and Networking},
	volume = {2015},
	number = {1},
	year = {2015},
	note = {cited By 0},
	abstract = {Analytical performance evaluation of a digital communication system remains a serious problem especially when a sophisticated digital signal processing is considered. Moreover, it is difficult to obtain the expected performance of such system using the Monte Carlo simulation method. In this paper, we propose a new semi-analytical approach for predicting error probability in a digital communication system. This approach is based on Fourier transform inversion formula to estimate the probability density function (pdf) of the observed soft sample at the receiver. Furthermore, we applied a bootstrap method for selecting the optimal smoothing parameter to make the proposed semi-analytical method more accurate. Simulation results show that the obtained semi-analytical error probability is close to the one measured using Monte Carlo simulation and provides a significant gain in terms of computing time. Besides, the use of the bootstrap method decreases the squared error between the true pdf and the estimated one. {\textcopyright} 2015, Naamane et al.},
	doi = {10.1186/s13638-015-0467-2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84945334687\&doi=10.1186\%2fs13638-015-0467-2\&partnerID=40\&md5=65b273dd6e260c94dadf1b8ec22e96ac},
	author = {Naamane, F.E.a and Et-tolba, M.b and Belkasmi, M.a}
}
@conference {Berkani2015,
	title = {Soft-decision decoding by a compact genetic algorithm using higher selection pressure},
	booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015},
	year = {2015},
	note = {cited By 1},
	abstract = {Selection pressure controls the selection of individuals from one population to the next. It gives individuals of higher quality, higher probability of being used to create the next generation, and so for the algorithm to focus on promising regions in the search space. This paper introduces higher selection pressure to soft-decision decoding based on compact Genetic Algorithms(cGAD), and shows the effectiveness of tournament selection in the performances of the decoder. The effect of tournament size is also studied, and the new decoder based on higher selection pressure outperforms Chase-2 algorithm. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WINCOM.2015.7381308},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965013753\&doi=10.1109\%2fWINCOM.2015.7381308\&partnerID=40\&md5=b9dbc3ea41fe5d23850cbcb72d0df592},
	author = {Berkani, A.a and Azouaoui, A.b and Belkasmi, M.a}
}
@conference {Et-Tolba2014,
	title = {Fast performance prediction method for QPSK modulation},
	booktitle = {4th International Conference on Communications and Networking, ComNet 2014 - Proceedings},
	year = {2014},
	note = {cited By 0},
	abstract = {Quadrature phase shift keying (QPSK) is one of modulation schemes used in advanced wireless communication systems. It is known to be robust against the channel impairement. However, when it is used with sophisticated signal processing, it makes Monte Carlo simulation method time consumming. In this paper, we propose a semi-analytical prediction method which provides a significant gain in term of computing time. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ComNet.2014.6840919},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904625389\&doi=10.1109\%2fComNet.2014.6840919\&partnerID=40\&md5=b70a8e70d411010846eacd41e3ade011},
	author = {Et-Tolba, M.a and Naamane, F.E.b and Belkasmi, M.a}
}
@conference {ElBouanani2014,
	title = {Novel results for the spectral efficiency and symbol error rate of GSC receiver over identical and uncorrelated weibull fading channels},
	booktitle = {2014 World Congress on Computer Applications and Information Systems, WCCAIS 2014},
	year = {2014},
	note = {cited By 0},
	abstract = {In this work, we introduce a novel probability density function (PDF)-based expression to obtain the maximum average spectral efficiency (MASE) and the average symbol error rate (ASER) of L-branch Generalized Selection Combining (GSC) receiver over independent and identical Weibull fading channels. Approximating the output SNR by a simple H-distribution, useful expressions of outage probability, MASE and ASER for some M-Ary modulation schemes are derived in terms of Meijer G-function. The approximated PDF is validated by computed simulations using Mathematica software. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCCAIS.2014.6916586},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908675984\&doi=10.1109\%2fWCCAIS.2014.6916586\&partnerID=40\&md5=3d3e87c25c4705f20eb8ff4c6e7a5025},
	author = {El Bouanani, F.a and Ben-Azza, H.b and Belkasmi, M.a}
}
@conference {Belkasmi2014,
	title = {Preface},
	booktitle = {WCCCS 2014 - Proceedings; 2014 5th Workshop on Codes, Cryptography and Communication Systems},
	year = {2014},
	note = {cited By 0},
	doi = {10.1109/WCCCS.2014.7107899},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983197048\&doi=10.1109\%2fWCCCS.2014.7107899\&partnerID=40\&md5=9d49b4a3c5ec947f575872ad21efecf5},
	author = {Belkasmi, M.a and Aaroud, A.b}
}
@conference {Chanyour2014274,
	title = {Routing based on network coding and clustering in DTMN},
	booktitle = {2014 2nd World Conference on Complex Systems, WCCS 2014},
	year = {2014},
	note = {cited By 0},
	pages = {274-279},
	abstract = {Network coding is a novel technique that aims to improve routing schemes{\textquoteright} throughput. Besides, clustering is used to cope with the scalability problem among high scale networks. This paper combines the use of both techniques to address routing problem in Delay Tolerant Mobile Networks (DTMN). By the mean of its routing, the cluster based routing protocol we use offers opportunities for principal network coding operation, mainly the coding and decoding operations. Once a routed packet is received by the cluster head, it codes it regarding its destination cluster. The last cluster head performs decoding operation to deliver packets to their destination. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICoCS.2014.7060962},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84929144319\&doi=10.1109\%2fICoCS.2014.7060962\&partnerID=40\&md5=84d1f44e74172c044f700eb2a47a7999},
	author = {Chanyour, T.a and Saadane, R.b and Belkasmi, M.a}
}
