@conference { ISI:000376431400006,
	title = {Cryptographic Algorithm Approach for Low Cost RFID Systems},
	booktitle = {PROCEEDINGS OF THE MEDITERRANEAN CONFERENCE ON INFORMATION \& COMMUNICATION TECHNOLOGIES 2015, VOL 1},
	series = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {Mediterranean Conference on Information and Communication Technologies (MedCT), MOROCCO, MAY 07-09, 2015},
	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.},
	isbn = {978-3-319-30301-7; 978-3-319-30299-7},
	issn = {1876-1100},
	doi = {10.1007/978-3-319-30301-7\_6},
	author = {Labbi, Zouheir and Maarof, Ahmed and Senhadji, Mohamed and Belkasmi, Mostafa},
	editor = {ElOualkadi, A and Choubani, F and ElMoussati, A}
}
@article { ISI:000391110500010,
	title = {Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method},
	journal = {INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS},
	volume = {7},
	number = {9},
	year = {2016},
	month = {SEP},
	pages = {63-68},
	abstract = {In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an integer). This method searches circulant matrices in order to find the good quasi-cyclic code (QCC) having the largest minimum distance. A modified simulated annealing algorithm is used as an evaluator tool of the minimum distance of the obtained QCC codes. Based on this method we found 16 good quasi-cyclic codes with rates (1/2, 2/3 and 3/4), their estimated minimum distance reaches the lower bounds of codes considered to be the better linear block codes in Brouwer{\textquoteright}s database.},
	issn = {2158-107X},
	author = {Aylaj, Bouchaib and Belkasmi, Mostafa and Nouh, Said and Zouaki, Hamid}
}
@conference { ISI:000389502600020,
	title = {Hybrid Encryption Approach Using Dynamic Key Generation and Symmetric Key Algorithm for RFID Systems},
	booktitle = {Networked Systems, NETYS 2016},
	series = {Lecture Notes in Computer Science},
	volume = {9944},
	year = {2016},
	note = {4th International Conference on Networked Systems (NETYS), Marrakech, MOROCCO, MAY 18-20, 2016},
	pages = {244-249},
	abstract = {The security of RFID systems become an important subject especially for low cost RFID tags. A lot of Cryptographic algorithms were proposed to insure the security and in the same time meet the resource limitations. In this paper, we proposed a hybrid cryptographic approach as symmetric key encryption technique which generate the key dynamically, together with integrity check parameters. The generation of key stream follows the chained approach, beginning from the initial key pre-shared. As a result, the computational complexity will be reduced as well as increase performance.},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-46140-3\_20},
	author = {Labbi, Zouheir and Maarof, Ahmed and Senhadji, Mohamed and Belkasmi, Mostafa},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@article {12119042120160101,
	title = {Internet of Things Security: Layered classification of attacks and possible Countermeasures.},
	journal = {E-Ti: E-Review in Technologies Information},
	number = {9},
	year = {2016},
	pages = {66 - 80},
	abstract = {Internet of Things is undoubtedly a well-known research area. In fact, ensuring security of data exchange is among the great challenges of the Internet of things. In this paper, we endeavour to introduce a new classification of attacks in compliance with the OSI layers and the objective of security that we seek to attained in order to develop novel techniques and processes to fight against these attacks. (English) [ABSTRACT FROM AUTHOR]},
	keywords = {Attacks, Attaques, Computer network security, Contre-mesures, Countermeasures, Embedded Internet devices, Internet des Objets, Internet of things, RFID, S{\'e}curit{\'e}, Security, WSN},
	issn = {11148802},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=121190421\&site=ehost-live},
	author = {mouaatamid, Otmane E. l. and Lahmer, Mohammed and Belkasmi, Mostafa}
}
@article { ISI:000377221300068,
	title = {Iterative Threshold Decoding Of High Rates Quasi-Cyclic OSMLD Codes},
	journal = {INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS},
	volume = {7},
	number = {4},
	year = {2016},
	month = {APR},
	pages = {518-528},
	abstract = {Majority logic decoding (MLD) codes are very powerful thanks to the simplicity of the decoder. Nevertheless, to find constructive families of these codes has been recognized to be a hard job. Also, the majority of known MLD codes are cyclic which are limited in the range of the rates. In this paper a new adaptation of the Iterative threshold decoding algorithm is considered, for decoding Quasi-Cyclic One Step Majority logic codes (QC-OSMLD) codes of high rates. We present the construction of QC-OSMLD codes based on Singer difference sets of rate 1/2, and codes of high rates based on Steiner triple system which allows to have a large choice of codes with different lengths and rates. The performances of this algorithm for decoding these codes on both Additive White Gaussian Noise (AWGN) channel and Rayleigh fading channel, to check its applicability in wireless environment, is investigated.},
	issn = {2158-107X},
	author = {Rkizat, Karim and Yatribi, Anouar and Lahmer, Mohammed and Belkasmi, Mostafa}
}
@conference { ISI:000376431400023,
	title = {A New Semi-analytical Performance Prediction of a Digital Communication System},
	booktitle = {PROCEEDINGS OF THE MEDITERRANEAN CONFERENCE ON INFORMATION \& COMMUNICATION TECHNOLOGIES 2015, VOL 1},
	series = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {Mediterranean Conference on Information and Communication Technologies (MedCT), MOROCCO, MAY 07-09, 2015},
	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.},
	isbn = {978-3-319-30301-7; 978-3-319-30299-7},
	issn = {1876-1100},
	doi = {10.1007/978-3-319-30301-7\_23},
	author = {Naamane, Fatima Ezzahra and Et-tolba, Mohamed and Belkasmi, Mostafa},
	editor = {ElOualkadi, A and Choubani, F and ElMoussati, A}
}
@conference { ISI:000391420400041,
	title = {Novel Mutual Authentication Scheme for Low-eCost RFID Systems},
	booktitle = {2016 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM)},
	year = {2016},
	note = {International Conference on Wireless Networks and Mobile Communications (WINCOM), Fez, MOROCCO, OCT 26-29, 2016},
	pages = {P240-P245},
	publisher = {Univ Sidi Mohamed Ben Abdellah; FST FES; MobiTic; IEEE; IEEE Commun Soc; FSDM; ENSIAS; FST Mohammedia; CLusMed; TICSM Res Pole; Master Tec; CNRST; EBSA Fez; Mobit Assoc},
	organization = {Univ Sidi Mohamed Ben Abdellah; FST FES; MobiTic; IEEE; IEEE Commun Soc; FSDM; ENSIAS; FST Mohammedia; CLusMed; TICSM Res Pole; Master Tec; CNRST; EBSA Fez; Mobit Assoc},
	abstract = {The importance of radio frequency identification (RFID) increases for its powerful capabilities for identifying, locating and automatic access control objects. Electronic Product Code Class 1 Generation 2 (EPC-C1G2) is served as the most popular standard for passive RFID tags. In the last year several schemes were proposed to improve security of EPC-C1G2, most of these schemes still vulnerable and cannot resist some attacks and others schemes exceeds the powerful computing capacity of passive tag. In this paper, we propose a new authentication mutual scheme compliant to EPC-C1G2 standard. The proposed scheme uses only ultra-lightweight operations, Cyclic Redundancy Code (CRC), exclusive OR (XOR) and Pseudo Random Number Generators (PRNG). We have demonstrated that proposed scheme resist against security attacks and more that is better than the previous schemes in terms of the communication and computation cost.},
	isbn = {978-1-5090-3837-4},
	author = {Maarof, Ahmed and Senhadji, Mohamed and Labbi, Zouheir and Belkasmi, Mostafa},
	editor = {ElKamili, M and Berrada, I and Badri, A and Ghennioui, H}
}
@conference { ISI:000388603102055,
	title = {A saddle-point based approach for semi-analytical performance evaluation of a digital communication system},
	booktitle = {2016 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE},
	series = {IEEE Wireless Communications and Networking Conference},
	year = {2016},
	note = {IEEE Wireless Communications and Networking Conference (WCNC), Doha, QATAR, APR 03-07, 2016},
	publisher = {IEEE; IEEE Commun Soc},
	organization = {IEEE; IEEE Commun Soc},
	abstract = {Nowadays, it has become difficult to obtain the expected performance of a digital communication system using the Monte Carlo simulation method. This is due to advanced technologies used in the transmitter and the receiver. In this paper, we propose a new semi-analytical approach for deriving the error probability. It combines the saddle-point approximation and bootstrap technique for estimating the probability density function. Simulation results show that the obtained semi-analytical error probability is close to that measured with Monte Carlo simulation and provides a significant gain in terms of computing time.},
	isbn = {978-1-4673-9814-5},
	issn = {1525-3511},
	author = {Naamane, Fatima Ezzahra and Et-tolba, Mohamed and Belkasmi, Mostafa}
}
@conference { ISI:000376431400019,
	title = {Simulated Annealing Decoding of Linear Block Codes},
	booktitle = {PROCEEDINGS OF THE MEDITERRANEAN CONFERENCE ON INFORMATION \& COMMUNICATION TECHNOLOGIES 2015, VOL 1},
	series = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {Mediterranean Conference on Information and Communication Technologies (MedCT), MOROCCO, MAY 07-09, 2015},
	pages = {175-183},
	abstract = {In this paper, we present a hard-decision decoding algorithm using Simulated Annealing (SA) technique. The main idea is to find the optimal solution of the transmitted codeword by a process hopping between two different tasks. The simulations, applied on some binary linear block codes over the AWGN channel, show that the Simulated Annealing decoder has the same performance as the Berlekamp-Massey Algorithm (BM). Furthermore SA Decoder is more efficient compared to other Decoder based on Genetic algorithms in terms of performance and run time.},
	isbn = {978-3-319-30301-7; 978-3-319-30299-7},
	issn = {1876-1100},
	doi = {10.1007/978-3-319-30301-7\_19},
	author = {Aylaj, Bouchaib and Belkasmi, Mostafa},
	editor = {ElOualkadi, A and Choubani, F and ElMoussati, A}
}
@conference { ISI:000380509200004,
	title = {Construction of Cyclic One-Step Majority-Logic Decodable Codes using Genetic Algorithms},
	booktitle = {2015 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM)},
	year = {2015},
	note = {International conference on wireless networks and mobile communications, Marrakech, MOROCCO, OCT 20-23, 2015},
	pages = {17-22},
	abstract = {In {[}6], a construction of cyclic one-step majoritylogic 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.},
	isbn = {978-1-4673-8224-3},
	author = {Yatribi, Anouar and Ayoub, Fouad and Belkasmi, Mostafa}
}
@conference { ISI:000383221800021,
	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)},
	year = {2015},
	note = {5th World Congress on Information and Communication Technologies (WICT), Marrakesh, MOROCCO, DEC 14-16, 2015},
	pages = {117-122},
	publisher = {IEEE; IEEE Morocco Sect; IEEE Morocco Sect; IEEE SMC Tech Comm Soft Comp; Lab Informatique, Reseaux Mobilite Modelisation; lab Res Grp Intelligent Machines; MIR Labs},
	organization = {IEEE; IEEE Morocco Sect; IEEE Morocco Sect; IEEE SMC Tech Comm Soft Comp; Lab Informatique, Reseaux Mobilite Modelisation; lab Res Grp Intelligent Machines; MIR Labs},
	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.},
	isbn = {978-1-4673-8712-5},
	author = {Rkizat, Karim and Lahmer, Mohammed and Belkasmi, Mostafa},
	editor = {Abrahim, A and Alimi, AM and Haqiq, A and Karray, H and Mousannif, H and BenHalima, M and Choo, YH and Ma, K}
}
@conference { ISI:000380408200012,
	title = {Secure Sparse Network Coding for Reliable Routing in Large Scale DTMN},
	booktitle = {2015 THIRD INTERNATIONAL WORKSHOP ON RFID AND ADAPTIVE WIRELESS SENSOR NETWORKS (RAWSN)},
	year = {2015},
	note = {3rd International Workshop on RFID and Adaptive Wireless Sensor Networks (RAWSN), Agadir, MOROCCO, MAY 13-15, 2015},
	pages = {57-62},
	publisher = {FST FES; IEEE Morocco Sect; CNRST; MobiTic; Laboratoire Signaux Systemes Composants; LiMs Laboratoire},
	organization = {FST FES; IEEE Morocco Sect; CNRST; MobiTic; Laboratoire Signaux Systemes Composants; LiMs Laboratoire},
	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.},
	isbn = {978-1-4673-8096-6},
	author = {Chanyour, Tarik and Saadane, Rachid and Belkasmi, Mostafa},
	editor = {Berrada, I and Ghennioui, H}
}
@article {11060479520151029,
	title = {A semi-analytical performance prediction of a digital communication system using Fourier transform inversion.},
	journal = {EURASIP Journal on Wireless Communications \& Networking},
	volume = {2015},
	number = {1},
	year = {2015},
	pages = {1 - 13},
	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},
	keywords = {Bit error probability, Bit error rate {\textendash} Research, Digital communications {\textendash} Research, Fourier transform infrared spectroscopy {\textendash} Research, Fourier transform inversion, Monte Carlo method {\textendash} Research, pdf, Semi-analytical approach, Signal processing {\textendash} Digital techniques {\textendash} Research, Smoothing parameter},
	issn = {16871472},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=110604795\&site=ehost-live},
	author = {Naamane, Fatima and Et-tolba, Mohamed and Belkasmi, Mostafa}
}
@article { ISI:000379488000001,
	title = {A semi-analytical performance prediction of a digital communication system using Fourier transform inversion},
	journal = {EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING},
	year = {2015},
	month = {OCT 29},
	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.},
	issn = {1687-1499},
	doi = {10.1186/s13638-015-0467-2},
	author = {Ezzahra Naamane, Fatima and Et-tolba, Mohamed and Belkasmi, Mostafa}
}
@conference { ISI:000380509200011,
	title = {Soft-decision Decoding by a compact Genetic Algorithm using higher selection pressure},
	booktitle = {2015 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM)},
	year = {2015},
	note = {International conference on wireless networks and mobile communications, Marrakech, MOROCCO, OCT 20-23, 2015},
	pages = {58-63},
	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.},
	isbn = {978-1-4673-8224-3},
	author = {Berkani, Ahlam and Azouaoui, Ahmed and Belkasmi, Mostafa}
}
@conference { ISI:000380509200025,
	title = {A Variant of HB Protocols Based on Permutation for Low-cost RFID},
	booktitle = {2015 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM)},
	year = {2015},
	note = {International conference on wireless networks and mobile communications, Marrakech, MOROCCO, OCT 20-23, 2015},
	pages = {145-148},
	abstract = {The security issues of RFID technology have been subject of a large number of research documents for over a decade. Several protocols have been developed to ensure reliable access control, namely a family of lightweight authentication protocols since Hopper and Blum proposed the HB protocol in 2001. Taking into account security and performance aspects, we present a new protocol derived from HB+ in which we add the permutation function, providing more effective resistant execution environment of active attacks and with roughly the same complexity.},
	isbn = {978-1-4673-8224-3},
	author = {Ouaskou, Mohamed and Lahmer, Mohammed and Belkasmi, Mostafa}
}
@conference { ISI:000371484600022,
	title = {Efficient Vertical handover scheme on IMS network and cost analysis},
	booktitle = {2014 THIRD IEEE INTERNATIONAL COLLOQUIUM IN INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}14)},
	series = {Colloquium in Information Science and Technology},
	year = {2014},
	note = {3rd IEEE International Colloquium on Information Science and Technology (CIST), Tetouan, MOROCCO, OCT 20-22, 2014},
	pages = {129-134},
	publisher = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan},
	organization = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan},
	abstract = {According to the various mobility, the resource allocation, interference, and the characteristics of heterogeneity and ubiquity of access network based on the next generation network, namely, the network IMS (IP Multimedia subsystem), have imposed several challenges. In regard to mobility management, handover management, and Quality of Service (QoS) provisioning, this paper proposes an adaptive environment based on IMS, between the heterogeneous access technologies, like WiMAX, WLAN, UMTS and LTE/LTE Advanced interfaces. Nevertheless, especially, the problem of handover decision, as resolving it influence, mainly on the handover performance; ANN(Artificial Neural Network) is proposed to solve the problem of decision and selection of best network access based IMS. The objective of proposed approach algorithms, is to maximize handover performance and reliability, with a new generic mobility management architecture, for system resource utilization by reducing handover latency and achieving load balance between different heterogeneous cells and networks},
	isbn = {978-1-4799-5979-2},
	issn = {2327-185X},
	author = {Allouch, Hamid and Belkasmi, Mostafa},
	editor = {ElMohajir, M and AlAchhab, M and Chahhou, M}
}
@conference { ISI:000364216300015,
	title = {Fast Performance Prediction Method for QPSK Modulation},
	booktitle = {2014 International Conference on Communications and Networking (ComNet)},
	series = {International Conference on Communications and Networking},
	year = {2014},
	note = {4th International Conference on Communications and Networking (ComNet), Hammamet, TUNISIA, MAR 19-22, 2014},
	publisher = {IEEE; SUPCOM; MEDIATRON; TUNISIE TELECOM; Microsoft Tunisia; Ecole Doctorale Technol Informat COmmun; Instance Natl Telecommunicat},
	organization = {IEEE; SUPCOM; MEDIATRON; TUNISIE TELECOM; Microsoft Tunisia; Ecole Doctorale Technol Informat COmmun; Instance Natl Telecommunicat},
	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.},
	isbn = {978-1-4799-3764-6},
	issn = {2163-663X},
	author = {Et-tolba, Mohamed and Ezzahra Naamane, Fatima and Belkasmi, Mostafa}
}
@conference { ISI:000366999600264,
	title = {FPGA Implementation of HIHO and SIHO Decoders for DSC Codes},
	booktitle = {2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2014},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Marrakech, MOROCCO, APR 14-16, 2014},
	pages = {1461-1464},
	abstract = {This paper presents the study of two decoder architectures and their VHDL design and implementation on a FPGA circuit. Both decoders are designed for Difference Set Cyclic (DSC) codes. The first one is the Hard In - Hard Out decoder (HIHO), and the second one is the Massey{\textquoteright}s threshold Soft In - Hard Out (SIHO) decoder. The two architectures are analyzed and discussed for serial and parallel processing implementations. The results show that the complexity, measured by the number of Logical Elements (LE) which is directly proportional to the silicon area occupied by the decoder, varies linearly for serial processing and hyperbolically for parallel processing. Increased complexity related to parallel processing can be accepted in turbo decoders. The resulting latency (L) is equal to the code length (n) multiplied by the clock period (H): (L=n{*}H).},
	isbn = {978-1-4799-3824-7},
	author = {Boudaoud, Abdelghani and Abdelmounim, Elliassane and Barazzouk, Abdellfattah and Zbitou, Jamal and Belkasmi, Mostafa}
}
@conference { ISI:000363271300046,
	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)},
	year = {2014},
	note = {World Congress on Computer Applications and Information Systems (WCCAIS), Hammamet, TUNISIA, JAN 17-19, 2014},
	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 Wei bull 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.},
	isbn = {978-1-4799-3351-8},
	author = {El Bouanani, Faissal and Ben-Azza, Hussain and Belkasmi, Mostafa}
}
@conference { ISI:000380387700085,
	title = {Routing based on Network Coding and Clustering in DTMN},
	booktitle = {2014 SECOND WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS)},
	year = {2014},
	note = {2014 Second World Conference on Complex Systems (WCCS), Agadir, MOROCCO, NOV 10-12, 2014},
	pages = {274-279},
	publisher = {Ibn Zohr Univ; Moroccan Soc of Complex Syst; IEEE Morocco; Int Acad for Syst and Cybernet Sci IASCYS},
	organization = {Ibn Zohr Univ; Moroccan Soc of Complex Syst; IEEE Morocco; Int Acad for Syst and Cybernet Sci IASCYS},
	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.},
	isbn = {978-1-4799-4647-1},
	author = {Chanyour, Tarik and Saadane, Rachid and Belkasmi, Mostafa}
}
@conference { ISI:000325229700053,
	title = {Design of distributed IMS by classification and evaluation of costs for secured architecture},
	booktitle = {2012 SECOND INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING TECHNOLOGY (INTECH)},
	year = {2012},
	note = {2nd International Conference on Innovative Computing Technology (INTECH), Casablanca, MOROCCO, SEP 18-20, 2012},
	pages = {291-296},
	publisher = {IEEE UK \& RI Consumer Elect Chapter; IEEE Broadcast Technol Chapter; IEEE},
	organization = {IEEE UK \& RI Consumer Elect Chapter; IEEE Broadcast Technol Chapter; IEEE},
	abstract = {The core of Next Generation Network(NGN) IP Multimedia subsystem(IMS) based on SIP as mechanism signaling, is an important challenge for supporting data communication services, voice, video, messaging and web-based technologies. In this work we present a novel design of architecture and turns up some challenges of new IMS architecture and security system. This architecture provides a robustness, reliability, scalability and strategy for extension in the future and responds to the security challenges. We introduced the architecture with clustering database HSS and automatic storage of data that give a secure database. This paper give a classification of security in IMS network, modulate the risk in IMS network and our comparison is giving by cost signaling interworking with and without securing Gateway (SEG). We show that there is a tradeoff between the level of increasing system security and the potential cost incurred. we conclude that this architecture is suitable for operators and services providers for the new business models.},
	isbn = {978-1-4673-2679-7},
	author = {Allouch, Hamid and Belkasmi, Mostafa}
}
@article {8699110620120101,
	title = {Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms.},
	journal = {Journal of Electrical \& Computer Engineering},
	year = {2012},
	pages = {1 - 12},
	abstract = {A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms [ABSTRACT FROM AUTHOR]},
	keywords = {Coding theory, Computational complexity, Data transmission systems, Decoders (Electronics) {\textendash} Software, Genetic algorithms, Performance evaluation},
	issn = {20900147},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=86991106\&site=ehost-live},
	author = {Azouaoui, Ahmed and Belkasmi, Mostafa and Farchane, Abderrazak}
}
@conference { ISI:000310353000141,
	title = {An Efficient method to find the Minimum Distance of Linear Block Codes},
	booktitle = {2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2012},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Tangiers, MOROCCO, MAY 10-12, 2012},
	pages = {773-779},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {Finding the minimum distance of linear codes is in general a NP-hard problem, we propose an efficient algorithm to attack this problem. The principle of this approach is to search code words locally around the all-zero code word perturbed by a level of noise magnitude, in other words the maximum of noise that can be corrected by a Soft-In decoder, anticipating that the resultant nearest non-zero code words will most likely contain the minimum Hamming weight code word, whose Hamming weight is equal to the minimum distance of the linear code. A numerous results prove that the proposed algorithm is valid for general linear codes and it is very fast comparing to all others known techniques, therefore it is a good tool for computing. Comparing to Joanna{\textquoteright}s works, we proof that our algorithm has a low complexity with a fast time of execution. For some linear RQs, QDCs and BCHs codes with unknown minimum distance, we give a good estimation (true) of the minimum distance where the length is less than 439.},
	isbn = {978-1-4673-1520-3},
	author = {Askali, Mohamed and Nouh, Said and Belkasmi, Mostafa},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000012,
	title = {Evaluation of Hybrid Geo-location based on UMTS and OPS Technologies},
	booktitle = {2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2012},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Tangiers, MOROCCO, MAY 10-12, 2012},
	pages = {63-67},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {The degree of accuracy and availability of service make a distinction between the two main methods of geolocation that areGPS and UMTS. GPS provides good performances in terms of location in open area, but performances degrade to a significant manner when we go into an enclosed area. While the UMTS offers good results in urban areas, we can note a complementarity between these two techniques. In this paper we present a hybrid algorithm that combines these two techniques and takes best advantage of each of them with two approaches one simple and another advanced.},
	isbn = {978-1-4673-1520-3},
	author = {Saadane, Rachid and Belkasmi, Mostafa and El Koutbi, Mohammed and Dadda, Mohamed Rachid},
	editor = {Essaaidi, M and Zaz, Y}
}
@conference { ISI:000310353000213,
	title = {A New Genetic Decoding of Linear Block Codes},
	booktitle = {2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)},
	year = {2012},
	note = {International Conference on Multimedia Computing and Systems (ICMCS), Tangiers, MOROCCO, MAY 10-12, 2012},
	pages = {1176-1182},
	publisher = {Morocco Sect MTT/AP Joint Chapter},
	organization = {Morocco Sect MTT/AP Joint Chapter},
	abstract = {In this paper, we present a new hard-decision decoding technique based on Genetic Algorithms, which is applicable to the more general case where the only known structure is given by the parity-check matrix H. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We also presented a new soft-decision decoding based on Genetic Algorithms and the Chase algorithm. The simulations applied on some binary Linear Block Codes, show that the genetic decoder has the same performance as the Berlekamp-Massey Algorithm (BM) and Cardoso algorithm.},
	isbn = {978-1-4673-1520-3},
	author = {Azouaoui, Ahmed and Belkasmi, Mostafa},
	editor = {Essaaidi, M and Zaz, Y}
}
@article { ISI:000322276600002,
	title = {New results for Shannon capacity over generalized multipath fading channels with MRC diversity},
	journal = {EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING},
	year = {2012},
	abstract = {In this article, we investigate the Shannon capacity for L-branch maximal combining ratio (MRC) over generalized multipath fading channel. We derive closed-form expressions of the maximal spectral efficiency over Rayleigh, Rician, Nakagami-m, and Weibull multipath fading channel under flat fading conditions. The results are expressed in terms of Meijer G-functions, which can be evaluated numerically using mathematical tools such as Mathematica and Maple. We show, in particular, that the more the number L increases, the larger the Shannon capacity is. We deduce that four branches are sufficient in several cases to mitigate the fading effect and the channel model will approaches the one of AWGN.},
	issn = {1687-1499},
	doi = {10.1186/1687-1499-2012-336},
	author = {El Bouanani, Faissal and Ben-Azza, Hussain and Belkasmi, Mostafa}
}
@conference { ISI:000261578001126,
	title = {An efficient decoder based on the genetic algorithms over a fading multipath channel in CDMA-based cellular systems},
	booktitle = {2008 3RD INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES: FROM THEORY TO APPLICATIONS, VOLS 1-5},
	year = {2008},
	note = {3rd International Conference on Information and Communication Technologies, Damascus, SYRIA, APR 07-11, 2008},
	pages = {2308+},
	abstract = {In this paper, an iterative decoding algorithm of product block codes based on the genetic algorithms is presented. We applied this algorithm over a Rician fading multipath channel in CODIT system, to symmetric and asymmetric PBC constructed from BCH and Quadratic Residue codes of rate 2/5 The results show that the proposed algorithm performances outperforms those of the concatenated Reed-Solomon/Convolutional coding scheme proposed in {[}1]. The excellent results obtained in this paper open broad prospects for iterative decoders based on the genetic algorithms.},
	isbn = {978-1-4244-1751-3},
	author = {Elbouanani, Faissal and Belkasmi, Mostafa and Berbia, Hassan}
}
@conference { ISI:000259601400047,
	title = {Iterative decoding of parallel concatenated block codes},
	booktitle = {2008 INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION ENGINEERING, VOLS 1-3},
	year = {2008},
	note = {International Conference on Computer and Communication Engineering, Kuala Lumpur, MALAYSIA, MAY 13-15, 2008},
	pages = {230-235},
	publisher = {Int Islam Univ Malaysia, Fac Engn},
	organization = {Int Islam Univ Malaysia, Fac Engn},
	abstract = {Parallel concatenated block (PCB) codes based on two systematic block codes and an interleaver are considered. In this study BCH codes are used as component codes. At the reception an iterative decoder using Chase-Pyndiah as Soft-in Soft-Out algorithm is designed. The effects of various component codes, interleaver size and pattern, and the number of iterations are investigated using simulations. The simulation results show that the slope of curves and coding gain are improved by increasing the number of iterations and/or the interleaver size. From the simulations we observe that the codes PCB based on BCH(127,106,7) and BCH(255,215,11) codes are respectively 1.7dB and 2.1 dB from Shannon limit.},
	isbn = {978-1-4244-2357-6},
	doi = {10.1109/ICCCE.2008.4580602},
	author = {Belkasmi, Mostafa and Farchane, Abderrazak}
}
