@article {Semmouni2022353,
	title = {Bitcoin security with a twisted Edwards curve},
	journal = {Journal of Discrete Mathematical Sciences and Cryptography},
	volume = {25},
	number = {2},
	year = {2022},
	note = {cited By 2},
	pages = {353-371},
	abstract = {The security of the Bitcoin cryptocurrency system depends on the Koblitz curve secp256k1 combined with the digital signature ECDSA and the hash function SHA-256. In this paper, we show that the security of Bitcoin with ECDSA and secp256k1 is not optimal and present a detailed study of the efficiency of Bitcoin with the digital signature algorithm Ed25519 combined with the twisted Edwards curve CurveEd25519 and the hash function SHA-512. We show that Bitcoin is more secure and more efficient with the digital signature algorithm Ed25519 and the twisted Edwards curve CurveEd25519. {\textcopyright} 2022 Taru Publications.},
	doi = {10.1080/09720529.2019.1681673},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85080957680\&doi=10.1080\%2f09720529.2019.1681673\&partnerID=40\&md5=1701fb22e429664ce981464ba5838610},
	author = {Semmouni, M.C. and Nitaj, A. and Belkasmi, M.}
}
@article {Labghough2022,
	title = {Mixed RF/FSO SWIPT-based OSLMD Coded AF Cooperative Communication System: Performance Analysis},
	journal = {IEEE Transactions on Green Communications and Networking},
	year = {2022},
	note = {cited By 0},
	pages = {1-1},
	abstract = {In this paper, the performance analysis of simultaneous wireless information and power transfer (SWIPT) using time switching (TS) protocol-based amplify-and-forward (AF) dual-hop mixed radio-frequency/free-space optic (RF/FSO) coded and uncoded communication system (CC and UC) is investigated. Specifically, we look at using the One-Step Majority-Logic Decodable (OSMLD) codes at the source and a majority logic decoding algorithm (MLGD) at the destination, jointly with the use of maximal-ratio combining and SWIPT/TS techniques at the relay. Furthermore, the RF link undergoes Nakagami-m model, while the second-hop is subject to M\&$\#$x00E1;laga-M atmospheric turbulence with the effect of pointing errors. Closed-form and asymptotic formulations for the average bit error probability (ABEP) are obtained in terms of the system parameters for both CC and UC scenarios in addition of the average channel capacity analysis. Computer-based Monte Carlo simulations were used to numerically validate all of the obtained mathematical formulations. Expectedly, it is shown that significant coding gains are achieved using OSMLD codes in comparison with UC. In addition, above a specific threshold of energy efficiency, the system performance gets steady in the high signal-to-noise-ratio regime. Moreover, the decoding method used in this work has been shown to be suitable for the SWIPT/TS-assisted RF/FSO coded AF cooperative communication system where high performance alongside low computational complexity are required. IEEE},
	keywords = {Average bit error probability, Bit error rate, Code, Communications systems, Computer circuits, Cooperative communication, Decodable codes, Decoding, Decoding algorithm, energy efficiency, Energy harvesting, Energy transfer, Errors, Fading channels, Fadings channels, Freespace optics, Intelligent systems, Majority logic decoding, Majority logic decoding algorithm decoding, Malagum-M channel, Maximal-ratio combining, Mixed radio-frequency/free-space optic system, Monte Carlo methods, Nakagami-m fading channels, One-step majority-logic decodable code., Optics systems, Probability, Radiofrequencies, Relay, Signal to noise ratio},
	doi = {10.1109/TGCN.2022.3207096},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85139431588\&doi=10.1109\%2fTGCN.2022.3207096\&partnerID=40\&md5=5e23fc48b261f30bd3d69e9c937abedb},
	author = {Labghough, S. and Ayoub, F. and Bouanani, F.E. and Belkasmi, M. and Qaraqe, K.A.}
}
@article {Azougaghe202211,
	title = {Turbo decoding of concatenated codes based on RS codes using adapted scaling factors},
	journal = {Infocommunications Journal},
	volume = {14},
	number = {1},
	year = {2022},
	note = {cited By 0},
	pages = {11-16},
	abstract = {Iteratively decoded block turbo codes are product codes that exhibit excellent performance with reasonable com-plexity. In this paper, a generalization of parallel concatenated block codes (GPCBs) based on RS codes is presented. We propose an efficient decoding algorithm with modifications of the Chase- Pyndiah algorithm is written by using Weighting factor α and Reliability factor β. In this work, we studied the effect of diverse parametres such as the effect of various component codes, interleaver size (number of sub-blocks) and number of iterations. The simulation results shows the relevance of the adapted parameters to decode generalized parallel concatenated block codes based on RS codes. The proposed algorithm (MCP) using the adapted parameters performs better than the one using with empirical parameters (CP). {\textcopyright} 2022 Scientific Association for Infocommunications. All rights reserved.},
	keywords = {Block codes, Block Turbo codes, Chase decoding, Concatenated codes, Generalized parallel con-catenated code, Iterative decoding, Iterative decodings, Modified chase- pyndiah algorithm, Performance, Product code, RS codes, Scaling factors, Turbo codes, Turbo decoding},
	doi = {10.36244/ICJ.2022.1.2},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129965517\&doi=10.36244\%2fICJ.2022.1.2\&partnerID=40\&md5=b8b9da3f379cbf44233c273bb8f4108f},
	author = {Azougaghe, E.-S. and Farchane, A. and Safi, S. and Belkasmi, M.}
}
@article {Semmouni2021768,
	title = {A New Electronic Voting System Based on Elliptic Curve in a Cloud Computing Environment},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1383 AISC},
	year = {2021},
	note = {cited By 0},
	pages = {768-778},
	abstract = {The process of democratization is developing and promoting due to electronic voting. However, the increase of frauds and the increasing amount of attacks launched by hackers, gave birth to privacy and authentication problems. Cryptography offers multiple solutions to overcome the sensitive data protection issues in e-voting. In this paper, we study the application of elliptic curve cryptography, and use the homomorphic encryption properties to present a new electronic voting system. Our new scheme is based on the homomorphic cryptosystem EC-ELGAMAL~[7], and zero knowledge algorithm of Schnorr algorithm for identification and authentication. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Authentication, Cloud computing environments, Electronic voting, Electronic voting systems, Elliptic curve cryptography, Geometry, Ho-momorphic encryptions, Homomorphic cryptosystem, Multiple solutions, Pattern recognition, Personal computing, Privacy by design, Public key cryptography, Schnorr algorithm, Sensitive data protections, Soft computing, Voting machines},
	doi = {10.1007/978-3-030-73689-7_73},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85105859364\&doi=10.1007\%2f978-3-030-73689-7_73\&partnerID=40\&md5=8bb3fcc911f5436bbd6e39378e1aec4a},
	author = {Semmouni, M.C. and Azougaghe, A. and Nitaj, A. and Belkasmi, M.}
}
@article {Yatribi2020226,
	title = {An Efficient and Secure Forward Error Correcting Scheme for DNA Data Storage},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {942},
	year = {2020},
	note = {cited By 0},
	pages = {226-237},
	abstract = {In this paper, a new efficient error correcting scheme for DNA archival digital data storage is proposed. We devise a double protection scheme for DNA oligos, aiming to ensure the protection of both information and indexing header data from both symbol flipping and erasure-burst errors, using two different cyclic ternary difference-set codes, which are known to be completely orthogonalisable and very easy to decode using a simple majority-logic decoding algorithm. We show that the proposed scheme is efficient and easily scalable, and provides a coding potential of 1.97 bit per nucleotide, and a reasonable net information density of 0.75 bit/nt under the considered experimental conditions, with relatively a lower decoding complexity and costs compared to other DNA data storage approaches. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Bioinformatics, Decoding, Decoding complexity, Difference sets, Digital storage, DNA, Error correcting scheme, Errors, Experimental conditions, Forward error correcting, Gene encoding, Information density, Majority logic, Pattern recognition, Protection schemes, Simple majority, Soft computing},
	doi = {10.1007/978-3-030-17065-3_23},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064931520\&doi=10.1007\%2f978-3-030-17065-3_23\&partnerID=40\&md5=215574899d2a75166c0a2fc343cb673e},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F.}
}
@article {Boualame202095,
	title = {An Efficient Semi-Algebraic Decoding Algorithm for Golay Code},
	journal = {Communications in Computer and Information Science},
	volume = {1264},
	year = {2020},
	note = {cited By 0},
	pages = {95-102},
	abstract = {In this paper, we propose an algorithm for decoding the QR(23,12,7) code knowing by the binary Golay code. This method never calculates unknown syndromes and does not need the error locator polynomial. Indeed, we use simple parameters to locate the error position. So, to validate the proposed method, all possible error patterns are tested and the proposed decoder correct all of them. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Block codes, Data communication systems, Decoding, Decoding algorithm, Error locator polynomial, Error patterns, Errors, Golay code, Security of data, Unknown syndromes},
	doi = {10.1007/978-3-030-61143-9_8},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097406038\&doi=10.1007\%2f978-3-030-61143-9_8\&partnerID=40\&md5=7ad6a041a67402ca70b0934aed15a68e},
	author = {Boualame, H. and Chana, I. and Belkasmi, M.}
}
@article {Yatribi2020,
	title = {Gradient-descent decoding of one-step majority-logic decodable codes},
	journal = {Physical Communication},
	volume = {39},
	year = {2020},
	note = {cited By 1},
	abstract = {In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (OSMLD) codes. We give a formulation of the decoding problem of binary OSMLD codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum{\textendash}product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required. {\textcopyright} 2020 Elsevier B.V.},
	keywords = {AWGN channel, Backpropagation, Computational complexity, Computer circuits, Decoding complexity, Difference sets, Economic and social effects, Electronic trading, Gradient descent, Gradient methods, Iterative decoding, LDPC codes, Majority logic, Majority logic decoding, Maximum likelihood, Maximum likelihood decoding, Optimization, OSMLD codes},
	doi = {10.1016/j.phycom.2019.100999},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077749482\&doi=10.1016\%2fj.phycom.2019.100999\&partnerID=40\&md5=830156cfb12a8ec3dbff2e002b3ade63},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F.}
}
@article {Azougaghe2020103,
	title = {Iterative Decoding of GSCB Codes Based on RS Codes Using Adapted Scaling Factors},
	journal = {Communications in Computer and Information Science},
	volume = {1264},
	year = {2020},
	note = {cited By 0},
	pages = {103-114},
	abstract = {In this work, we have extended two algorithms to decode generalized serially concatenated block codes based on RS codes (GSCB-RS). The first is the modified Chase-Pyndiah algorithm (MCPA) proposed by Farchane and Belkasmi[1]. The second is the Chase-Pyndiah algorithm (CPA) that is developed initially for decoding turbo product codes[2]. We also investigated the effect of different parameters, namely component codes, the size and structure of the interleaver and the number of iterations, using computer simulations. The simulations result shows that the performance of the GSCB-RS codes using the MCPA decoder out performs the CPA decoder that uses predetermined weighting factor (α) and reliability factor (β) parameters. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Block codes, Component codes, Concatenated codes, Data communication systems, Interleavers, Iterative decoding, Number of iterations, Reliability factor, RS codes, Scaling factors, Security of data, Turbo product codes, Weighting factors},
	doi = {10.1007/978-3-030-61143-9_9},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097364331\&doi=10.1007\%2f978-3-030-61143-9_9\&partnerID=40\&md5=5a3be47852101aec7c21c1ee8c52200c},
	author = {Azougaghe, E.-S. and Farchane, A. and Safi, S. and Belkasmi, M.}
}
@article {ElMouaatamid2020,
	title = {A Scalable Group Authentication Scheme Based on Combinatorial Designs with Fault Tolerance for the Internet of Things},
	journal = {SN Computer Science},
	volume = {1},
	number = {4},
	year = {2020},
	note = {cited By 2},
	abstract = {With the development of the Internet of Things, the scale of IoT system is becoming large. Due to the network congestion problems and the server capability, using unicast authentication will bring burden to the network link and server. In this paper, we propose a scalable group authentication scheme with fault tolerance based on combinatorial designs. Performance analysis of the proposed scheme is based on several metrics such as fault tolerance, scalability, energy consumption and storage overhead. Simulation results have shown that oval designs realize the best trade-off for all metrics. {\textcopyright} 2020, Springer Nature Singapore Pte Ltd.},
	doi = {10.1007/s42979-020-00247-3},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127243319\&doi=10.1007\%2fs42979-020-00247-3\&partnerID=40\&md5=931f3209f31ffb24bb90442a553f5133},
	author = {El Mouaatamid, O. and Lahmer, M. and Belkasmi, M.}
}
@article {M{\textquoteright}rabet2020121,
	title = {A Threshold Decoding Algorithm for Non-binary OSMLD Codes},
	journal = {Communications in Computer and Information Science},
	volume = {1264},
	year = {2020},
	note = {cited By 0},
	pages = {121-133},
	abstract = {In this paper, a non-binary version of the Soft-Input Hard-Output Threshold Decoder (TD) is proposed. Threshold decoding was initially devised by Massey for the binary case. This work is the continuity of our previous work, where we presented the Majority Logic Decoding (MLGD) algorithm for non-binary codes. Like the (MLGD), the proposed decoder has low complexity, but it is more suited for OSMLD codes with a large orthogonal structure in their dual codes, such as finite geometry codes. The performances of our decoder are shown in terms of bit, symbol, and block error rates. The obtained results are very encouraging. The obtained results of the TD show an amelioration compared to the MLGD, due to the use of the information received from the channel. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Block error rates, Convolutional codes, Data communication systems, Decoding, Finite geometry, Majority logic, Majority logic decoding, Non-binary codes, Orthogonal structures, Security of data, Soft inputs, Threshold decoders, Threshold decoding},
	doi = {10.1007/978-3-030-61143-9_11},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85097405119\&doi=10.1007\%2f978-3-030-61143-9_11\&partnerID=40\&md5=6ce0a05b3ed02c120b504b2bfd988f93},
	author = {M{\textquoteright}rabet, Z. and Ayoub, F. and Belkasmi, M.}
}
@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 {Maarof2018,
	title = {Authentication protocol for securing internet of things},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3234698.3234727},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85052520501\&doi=10.1145\%2f3234698.3234727\&partnerID=40\&md5=aa4a50dc34245080536baf0939bbbde6},
	author = {Maarof, A. and Senhadji, M. and Labbi, Z. and Belkasmi, M.}
}
@conference {Labghough20181,
	title = {Bit error probability analysis for majority logic decoding of CSOC codes over fading channels},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/COMMNET.2018.8360256},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048329058\&doi=10.1109\%2fCOMMNET.2018.8360256\&partnerID=40\&md5=cd402424adfc89cc9d288cf2d4c17684},
	author = {Labghough, S. and Ayoub, F. and Belkasmi, M.}
}
@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},
	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 {Labbi2018,
	title = {IoT smart homes based on RFID technology: Localization systems review},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2018},
	doi = {10.1145/3234698.3234700},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85052532882\&doi=10.1145\%2f3234698.3234700\&partnerID=40\&md5=3e4d0d9d2a265066d022bd7c80c257b8},
	author = {Labbi, Z. and Senhadji, M. and Maarof, A. and Belkasmi, M.}
}
@conference {Boualame20181,
	title = {New efficient decoding algorithm of the (17, 9, 5) quadratic residue code},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/COMMNET.2018.8360258},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048326657\&doi=10.1109\%2fCOMMNET.2018.8360258\&partnerID=40\&md5=198217e84a8461108632edc7190041a6},
	author = {Boualame, H. and Chana, I. and Belkasmi, M.}
}
@conference {Tahiri20181,
	title = {A novel detector based on the compact genetic algorithm for MIMO systems},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-6},
	doi = {10.1109/COMMNET.2018.8360279},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048346101\&doi=10.1109\%2fCOMMNET.2018.8360279\&partnerID=40\&md5=80e5367fed32603ca01e87c38d0b8d75},
	author = {Tahiri, N. and Azouaoui, A. and Belkasmi, M.}
}
@book {Maarof2018105,
	title = {Security in the internet of things},
	series = {Security and Privacy in Smart Sensor Networks},
	year = {2018},
	pages = {105-121},
	doi = {10.4018/978-1-5225-5736-4.ch006},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049817262\&doi=10.4018\%2f978-1-5225-5736-4.ch006\&partnerID=40\&md5=80e4b7c3b0310d29dc82712e2dc2e6bc},
	author = {Maarof, A. and Senhadji, M. and Labbi, Z. and Belkasmi, M.}
}
@conference {Khelifa2017211,
	title = {An accurate HSMM-based system for Arabic phonemes recognition},
	booktitle = {9th International Conference on Advanced Computational Intelligence, ICACI 2017},
	year = {2017},
	note = {cited By 1},
	pages = {211-216},
	abstract = {The majority of successful automatic speech recognition (ASR) systems utilize a probabilistic modeling of the speech signal via hidden Markov models (HMMs). In a standard HMM model, state duration probabilities decrease exponentially with time, which fails to satisfactorily describe the temporal structure of speech. Incorporating explicit state durational probability distribution functions (pdf) into the HMM is a famous solution to overcome this feebleness. This way is well-known as a hidden semi-Markov model (HSMM). Previous papers have confirmed that using HSMM models instead of the standard HMMs have enhanced the recognition accuracy in many targeted languages. This paper addresses an important stage of our on-going work which aims to construct an accurate Arabic recognizer for teaching and learning purposes. It presents an implementation of an HSMM model whose principal goal is improving the classical HMM{\textquoteright}s durational behavior. In this implementation, the Gaussian distribution is used for modeling state durations. Experiments have been carried out on a particular Arabic speech corpus collected from recitations of the Holy Quran. Results show an increase in recognition accuracy by around 1\% We confirmed via these results that such a system outperforms the baseline HTK when the Gaussian distribution is integrated into the HTK{\textquoteright}s recognizer back-end. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/ICACI.2017.7974511},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027464290\&doi=10.1109\%2fICACI.2017.7974511\&partnerID=40\&md5=169e067b67861858798f016d82e0e080},
	author = {Khelifa, M.O.M. and Belkasmi, M. and Abdellah, Y. and Elhadj, Y.O.M.}
}
@conference {Maarof2017,
	title = {Authentication protocol conforming to EPC class-1 Gen-2 standard},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {A Radio Frequency Identification (RFID) system is a contactless automatic identification system that uses small and low-cost tags. The restricted computation ability and limited memory space of low-cost tags make existing RFID systems vulnerable. EPC Class 1 Generation 2 (EPC-C1G2) is the most popular standard for low cost passive RFID tags. For improving security of this standard; many security schemes are designed for RFID system since the release of the EPC-C1G2. In 2012, Yoon et al. proposed a new RFID authentication protocol conforming to EPC-C1G2 standard. This paper discuss Yoon et al.{\textquoteright}s protocol, which is conforming to EPC-C1G2 standard, and shows that it suffers from common attack and computational and communication cost. Then we present our enhanced protocol which improves the security, reduce the complexity and increase the performance of identification systems efficiently. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843915},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015189847\&doi=10.1109\%2fACOSIS.2016.7843915\&partnerID=40\&md5=497b5f1e05260548d29eb5491926b3ce},
	author = {Maarof, A. and Senhadji, M. and Labbi, Z. and Belkasmi, M.}
}
@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.}
}
@conference {Boualame2017,
	title = {An efficient soft decision decoding algorithm using cyclic permutations and compact genetic algorithm},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {The compact genetic algorithm cGA is used in this paper to design an efficient soft-decision decoding algorithm, especially for the cyclic codes, because the cGA dramatically reduces the population{\textquoteright}s size and rapidly converges to the optimal solution compared to classical genetic algorithms. Our main contribution is to exploit the cyclic property of cyclic linear codes to reduce the complexity of the decoding process especially in the test sequences generation and re-encoding stage where we use the generator polynomial instead of the generator matrix. The second idea behind our decoding algorithm is the complexity improvement inside of cGA by decreasing the probability vector{\textquoteright}s length, which becomes less than the length of the cGA original one. The experiments were carried out on the most popular cyclic codes, and the results show that the performances of our algorithm are better than some famous decoding algorithms in terms of Bit Error Rate. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843936},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015170559\&doi=10.1109\%2fACOSIS.2016.7843936\&partnerID=40\&md5=249f966f42367ada53bac8892853f1c4},
	author = {Boualame, H. and Tahiri, N. and Chana, I. and Azouaoui, A. and Belkasmi, M.}
}
@article {Elmouaatamid2017299,
	title = {Group authentication with fault tolerance for internet of things},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10542 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {299-307},
	abstract = {With proliferation of the Internet of Things (IoT) applications, it is expected that 50 billion connected devices will be operating amongst us by 2020, so the normal authentication mechanism will be a big issue to handle to avoid causing a serious burden to server. As it is known, some devices could share the same characteristics such as the same geographical area, the same features. In this case, these devices could be in the same group and the group will be identify by an identity. Taking advantages from this mechanism, all devices can be authenticated at the same time using the group identity. Among group authentication issues are if a member device of the group cannot authenticate with the distributor of the group intentionally or unintentionally, the group loses its identity. This loss of identity causes the authentication failure of the other group devices. To solve this issue in IoT a fault tolerance scheme introduced for the group authentication architecture. Our algorithm of fault tolerance allows reconstructing the group authentication identity despite the lack of broken devices of the group. Indeed, reconstructing the group identity can be performed by using multi-secret sharing scheme based on an error correcting codes if a sufficient number of the group devices are available. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-68179-5_26},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034585657\&doi=10.1007\%2f978-3-319-68179-5_26\&partnerID=40\&md5=4674daff52472a601af95361285646e1},
	author = {Elmouaatamid, O. and Lahmer, M. and Belkasmi, M.}
}
@conference {Labghough2017,
	title = {Majority logic coding schemes performance over FSO channels},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {In this paper, the performance study of OSMLD convolutional self orthogonal (CSOC) and OSMLD block codes over Gamma-Gamma ΓΓ atmospheric turbulence channel is studied. We analyse the efficiency of channel coding technique for different atmospheric turbulence conditions by modeling the channel with a Gamma-Gamma ΓΓ distribution and with BPSK modulation. The results obtained by Monte Carlo simulation compare different coding schemes with different coding rates and with varying the effect of atmospheric turbulence. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843942},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015200697\&doi=10.1109\%2fACOSIS.2016.7843942\&partnerID=40\&md5=02e1867fcf077f466dc54bd1c2fa7108},
	author = {Labghough, S. and Ayoub, F. and Belkasmi, M.}
}
@conference {Azougaghe2017,
	title = {Many-to-one matching game towards secure virtual machines migration in cloud computing},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {Virtual machine migration represents a new topic of research last years. In this context, we present a new system based on matching game theory to design efficient and practical migration algorithms that work well with huge numbers of VMs and servers. This strategy solves VM migration, resources managements and load balancing problems in cloud computing environment. The experimental results show that our algorithm not only obtains multi-resource load balancing performance but also improves the cloud security services and gets a gain of resources consummation on all servers. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843922},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015191060\&doi=10.1109\%2fACOSIS.2016.7843922\&partnerID=40\&md5=6b59b3295f8598830c0771717fb9a86b},
	author = {Azougaghe, A. and Oualhaj, O.A. and Hedabou, M. and Belkasmi, M. and Kobbane, A.}
}
@conference {Farchane2017,
	title = {New decoder for linear block codes},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {This paper exposes a new decoder for linear bloc codes. The proposed decoder is based on the resolution of the parity equations system. Elsewhere, to reduce its complexity we have developed a criteria for early terminating the decoding, on the one hand. On the other hand, we introduced a fast method for generating test error patterns. Our decoder is suitable for linear bloc code of medium and high code rate. Because, it presents a reduced complexity compared to similar decoders presented in literature. Simulation results show that the basic decoder, Dual-R-0 out performs the Berlikamp-massey{\textquoteright}s one for the decoding of the BCH(63, 51) code with BPSk modulation over an AWGN channel. The performance of the decoder Dual-R-2 for the code BCH(2047, 2014) is about 0.9 dB away from the Shannon{\textquoteright}s limit at the bit error rate (BER) 10-5. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843939},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015196984\&doi=10.1109\%2fACOSIS.2016.7843939\&partnerID=40\&md5=e2078d92b0c8571a77d2222866cf5358},
	author = {Farchane, A. and Belkasmi, M.}
}
@conference {Addi2017,
	title = {New hard decision decoder of LDPC codes using single bit flipping algorithm},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {The Bit-Flipping (BF) algorithm is considered as a hard decoding method for LDPC codes. It is much simpler than the probabilistic methods like Sum Product Algorithm (SPA), and can be efficiently implemented by electronic circuits. In this paper, we propose a new Bit Flipping algorithm for Low-Density Parity- Check codes (LDPC) called Single Bit-Flipping (SBF). Compared to the Gallager Bit-Flipping algorithm, the proposed algorithm employs criteria of flipping single bit chosen carefully. This method eliminates the risk for flipping more than one bit at a time that can induce additional error bits and propagate the errors to the later iterations. We present some results obtained by applying this new method that provides a gain in performance in comparison to the standard Gallager Bit-Flipping with low complexity. {\textcopyright}2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238191},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041431498\&doi=10.1109\%2fWINCOM.2017.8238191\&partnerID=40\&md5=51139715da4295938142bee17d106a96},
	author = {Addi, S. and Berkani, A. and Azouaoui, A. and Belkasmi, M.}
}
@conference {Yatribi2017,
	title = {Non-binary cyclic majority-logic decodable codes: An algebraic construction by using Genetic Algorithms},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {In this paper, the construction of non binary cyclic One-Step Majority-Logic decoding codes from the dual domain and idempotents is investigated. This had led us to propose a new design algorithm based on Genetic Algorithms, as an extension to previous works on the binary field. With the proposed algorithm, we were able to obtain long new non-binary cyclic OSMLD codes with high coding rates and good correction capacities. In fact, two powerful properties of the algebraic construction are provided, firstly, the designed codes have their minimal distances dmin and dimensions calculated analyticaly, secondly, they can be decoded with a low-complexity majority-voting decoding scheme. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843935},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015215915\&doi=10.1109\%2fACOSIS.2016.7843935\&partnerID=40\&md5=4e462ad826ef141669b51bb0bf07198c},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F. and M{\textquoteright}rabet, Z.}
}
@conference {Labbi2017,
	title = {A novel efficient ultralightweight authentication algorithm for RFID systems},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {The security and privacy of RFID (Radio Frequency Identification) systems becomes an important subject especially for low cost RFID tags. A lot of authentication protocols were proposed to insure the security and in the same time meet the resource limitations. In this paper, we proposed an ultralight weight authentication approach based on permutation, XOR and rotation functions. As a result, the computational complexity and communication cost will be reduced as well as increase performance. Finally, our approach proves that the protocol is a lightweight, resistant to known attacks and has an effective security mechanism based on an analytical method. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843920},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015208818\&doi=10.1109\%2fACOSIS.2016.7843920\&partnerID=40\&md5=4252c34bda296ca38939e93620bb3164},
	author = {Labbi, Z. and Senhadji, M. and Maarof, A. and Belkasmi, M.}
}
@conference {ElMouaatamid2017,
	title = {One-step majority-logic decodable codes derived from oval designs},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {In this paper, we investigate the combinatorial design of a new class of One-Step Majority-Logic Decodable (OSMLD) codes, based on Balanced Incomplete Block Designs of type Oval, which are derived from finite geometry. We show that the constructed OSMLD codes provides high rates in addition to good correction capacities. Simulation results shows that the proposed codes converge well under iterative decoding with an efficient tradeoff between complexity and performances. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238185},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041435738\&doi=10.1109\%2fWINCOM.2017.8238185\&partnerID=40\&md5=cc9a3eeb1781ff8e1ea9d4a775da4221},
	author = {El Mouaatamid, O. and Lahmer, M. and Belkasmi, M. and M{\textquoteright}rabet, Z. and Yatribiz, A.}
}
@conference {Belkasmi2017,
	title = {Preface},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	doi = {10.1109/ACOSIS.2016.7843956},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015242234\&doi=10.1109\%2fACOSIS.2016.7843956\&partnerID=40\&md5=ac51ee9b7e0eea4375940b3f3b588dac},
	author = {Belkasmi, M. and El Bouanani, F.}
}
@conference {Berkani2017,
	title = {A reduced complexity decoder using compact genetic algorithm for linear block codes},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {The compact Genetic Algorithm decoder has been introduced in [9] as an efficient decoding method of linear block codes. It requires less storage memory than Genetic Algorithms based decoders. One of its major weakness is the big number of necessary iterations to reach convergence in comparison with Genetic Algorithms (GA) based decoders. We propose, in this work, new ideas allowing us to reduce the number of iterations from about 105 to just about 103 which reduces the complexity of decoding. This, without decreasing the decoding performance. We introduce a new stopping criterion based on the soft weight of the probability vector p, a new initialization method of p and we tried to combine both methods all together. Both performance study and the calculation of the average number of iterations ensure the effectiveness of the proposed decoder. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843925},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015167666\&doi=10.1109\%2fACOSIS.2016.7843925\&partnerID=40\&md5=5a7c05dbd39172dd4eae18956ce8e95e},
	author = {Berkani, A. and Belkasmi, M.}
}
@conference { ISI:000381755100012,
	title = {Applying Encryption Algorithm for Data Security in Cloud Storage},
	booktitle = {ADVANCES IN UBIQUITOUS NETWORKING},
	series = {Lecture Notes in Electrical Engineering},
	volume = {366},
	year = {2016},
	note = {International Symposium on Ubiquitous Networking (UNet), Casablanca, MOROCCO, SEP 08-10, 2015},
	pages = {141-154},
	abstract = {This paper proposes 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.},
	isbn = {978-981-287-990-5; 978-981-287-989-9},
	issn = {1876-1100},
	doi = {10.1007/978-981-287-990-5\_12},
	author = {Kartit, Zaid and Azougaghe, Ali and Kamal Idrissi, H. and El Marraki, M. and Hedabou, M. and Belkasmi, M. and Kartit, A.},
	editor = {Sabir, E and Medromi, H and Sadik, M}
}
@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.}
}
@article {Labbi2016244,
	title = {Hybrid encryption approach using dynamic key generation and symmetric key algorithm for RFID systems},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {9944 LNCS},
	year = {2016},
	note = {cited By 0},
	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. {\textcopyright} Springer International Publishing AG 2016.},
	doi = {10.1007/978-3-319-46140-3_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84990041918\&doi=10.1007\%2f978-3-319-46140-3_20\&partnerID=40\&md5=d8545d3fd6f2b1f8b844953b422053cf},
	author = {Labbi, Z. and Maarof, A. and Senhadji, M. and Belkasmi, M.}
}
@conference {Maarof2016240,
	title = {A novel mutual authentication scheme for low-cost RFID systems},
	booktitle = {Proceedings - 2016 International Conference on Wireless Networks and Mobile Communications, WINCOM 2016: Green Communications and Networking},
	year = {2016},
	note = {cited By 0},
	pages = {240-245},
	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. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/WINCOM.2016.7777221},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010332933\&doi=10.1109\%2fWINCOM.2016.7777221\&partnerID=40\&md5=1fff563fec3d60d322be588205c273c3},
	author = {Maarof, A. and Labbi, Z. and Senhadji, M. and Belkasmi, M.}
}
@article {Allouch201531,
	title = {Distributed CloudIMS: Future-Generation Network with Internet of Thing Based on Distributed Cloud Computing},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {308 AISC},
	number = {VOLUME 1},
	year = {2015},
	note = {cited By 0},
	pages = {31-45},
	abstract = {The next-generation network, cloud computing, and Internet of thing are a challenging and promising paradigm shift in IT world technology. Diminishing the cost for users for provisioning anywhere connecting at anytime from anywhere network, CloudIMS consists of interconnecting heterogeneous access technology and to respond to a major challenge for serving the increase in demand and scalable network access to share pool of configurable resource of enabling a convenient cloud computing. This paper mainly focused on common approach to integrate the IP multimedia subsystem (IMS), the Internet of thing, and cloud computing under the name of CloudIMS architecture which makes multimedia service easy to deploy on a cloud platform. We present the state of art of the different elements of CloudIMS. Moreover, we examine the layers designed for CloudIMS based on next-generation network access for mobile communication devices between different types of technologies (3GPP and non-3GPP), such as global system for mobile communication (GSM), wireless network, worldwide interoperability for microwave access (WiMAX), Universal Mobile Telecommunications System (UMTS) and long-term evolution (LTE). Finally, we present an architecture of CloudIMS according to our point of view, followed by a discussion of a use case for the future networks. {\textcopyright} Springer India 2015.},
	doi = {10.1007/978-81-322-2012-1_5},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906933110\&doi=10.1007\%2f978-81-322-2012-1_5\&partnerID=40\&md5=d708396f65127dc5fbaa3123c7e2b9aa},
	author = {Allouch, H. and Belkasmi, M.}
}
@conference {Allouch2015129,
	title = {Efficient vertical handover scheme on IMS network and cost analysis},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	volume = {2015-January},
	number = {January},
	year = {2015},
	note = {cited By 0},
	pages = {129-134},
	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. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/CIST.2014.7016606},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938073075\&doi=10.1109\%2fCIST.2014.7016606\&partnerID=40\&md5=5744e559709c7503fddc8baba7ed4f05},
	author = {Allouch, H. and Belkasmi, M.}
}
@conference {Azougaghe2015140,
	title = {An electronic voting system based on homomorphic encryption and prime numbers},
	booktitle = {Proceedings of the 2015 11th International Conference on Information Assurance and Security, IAS 2015},
	year = {2015},
	note = {cited By 1},
	pages = {140-145},
	abstract = {In this paper we present an electronic voting system based on homomorphic encryption to ensure privacy, confidentiality in the voting. Our proposal offers all the advantages of the multiplicatively homomorphic encryption cryptosystems. The proposed voting scheme is suitable for multi-candidate elections as well as for elections in which contains neutral votes. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISIAS.2015.7492759},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979503097\&doi=10.1109\%2fISIAS.2015.7492759\&partnerID=40\&md5=a062b12e4631c6978b161d42deb41a74},
	author = {Azougaghe, A. and Hedabou, M. and Belkasmi, M.}
}
@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.}
}
@conference {Ouaskou2015,
	title = {A variant of HB protocols based on permutation for low-cost RFID},
	booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015},
	year = {2015},
	note = {cited By 0},
	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. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WINCOM.2015.7381322},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965047054\&doi=10.1109\%2fWINCOM.2015.7381322\&partnerID=40\&md5=b58c88a2c45f92717f77780586fa9e13},
	author = {Ouaskou, M. and Lahmer, M. and Belkasmi, M.}
}
@conference {Koudougnon2014118,
	title = {A Genetic Algorithms based detector for MIMO STBC systems},
	booktitle = {WCCCS 2014 - Proceedings; 2014 5th Workshop on Codes, Cryptography and Communication Systems},
	year = {2014},
	note = {cited By 0},
	pages = {118-123},
	abstract = {This paper proposes a new STBC MIMO detector based on Genetic Algorithms (GA) that can approach the performances of an optimal detector based on the maximum likekihood dtector (MLD). This detector is a hybridization between the GA and a linear detector such as ZF or MMSE detector. The optimization of the parameters of the GA can significantly improve performances. Our detector was compared with other equivalent detectors. The results show that our proposed algorithm gives better performance. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCCCS.2014.7107906},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983119233\&doi=10.1109\%2fWCCCS.2014.7107906\&partnerID=40\&md5=a83799f8aa9373bdc7b5106c86a7ddc0},
	author = {Koudougnon, H. and Azouaoui, A. and Belkasmi, M.}
}
@conference {Maarof201411,
	title = {Security analysis of low cost RFID systems},
	booktitle = {WCCCS 2014 - Proceedings; 2014 5th Workshop on Codes, Cryptography and Communication Systems},
	year = {2014},
	note = {cited By 2},
	pages = {11-16},
	abstract = {RFID technology attracts strong interest worldwide; it provides a means for automatic identification of objects and is regarded as an indispensable part in the vision of the Internet of things. With the aid of RFID systems, life shall become more convenient and businesses shall become more productive. The low cost RFID technology faces serious security and privacy threats, wireless communication and cost-down consideration on RFID systems are the two main factors that cause these security threats. In order to comply with the resource constraint, a few new authentication protocols with lightweight encryptions are invented to fit the physical limitation of a passive tag. However, those proposed schemes cannot provide enough security level in general; more specifically, they cannot prevent all major or general attacks such as eavesdropping, tracking, replay attack and Denial of Service, and preserve the forward secrecy of tagged object at the same time. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCCCS.2014.7107902},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949928462\&doi=10.1109\%2fWCCCS.2014.7107902\&partnerID=40\&md5=6a46bc68b72d6d71ccd82de1c152cc52},
	author = {Maarof, A. and Senhadji, M. and Labbi, Z. and Belkasmi, M.}
}
@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 {Allouch2013112,
	title = {Improvement of QoS in IMS network using network coding},
	booktitle = {ACM International Conference Proceeding Series},
	year = {2013},
	note = {cited By 0},
	pages = {112-117},
	abstract = {Network coding provides a powerful and effective mechanism, instead of sending packets directly on the channel, the end node is allowed to combine and encode one or more packages before sending them. This process improves the speed of the performance, the rate of the transmission. In this paper, we present a survey of variants of network coding; we present the advantage of network coding in network convergence to IP Multimedia Subsystem (IMS), the classification of network codes, with their advantage. We show by analyzing the strategy of Network Coding, and the performance of the implementation of network coding in terms of messaging and media streaming in the generation IP Multimedia Subsystem network (IMS). We conclude that network coding can improve throughput, minimize transmission delay and minimize energy consumption in the networks of future generations IMS. Following the Network Coding can offer exciting possibilities for efficient transmission and helps raise the growing challenges of different types of applications on the Internet and media convergence based on IP IMS network. {\textcopyright} 2013 ACM.},
	doi = {10.1145/2536853.2536918},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84897660656\&doi=10.1145\%2f2536853.2536918\&partnerID=40\&md5=6468954e6cbb6fc58e9e71808c10f37a},
	author = {Allouch, H. and Belkasmi, M.}
}
@conference {Allouch2012291,
	title = {Design of distributed IMS by classification and evaluation of costs for secured architecture},
	booktitle = {2nd International Conference on Innovative Computing Technology, INTECH 2012},
	year = {2012},
	note = {cited By 0},
	pages = {291-296},
	doi = {10.1109/INTECH.2012.6457814},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874489555\&doi=10.1109\%2fINTECH.2012.6457814\&partnerID=40\&md5=af127257372de35e045a5f6946b76a7f},
	author = {Allouch, H. and Belkasmi, M.}
}
@article {Azouaoui2012,
	title = {Efficient dual domain decoding of linear block codes using genetic algorithms},
	journal = {Journal of Electrical and Computer Engineering},
	year = {2012},
	note = {cited By 1},
	doi = {10.1155/2012/503834},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84859819545\&doi=10.1155\%2f2012\%2f503834\&partnerID=40\&md5=6e6f96bbb49e27882bf30fa87aebeee4},
	author = {Azouaoui, A. and Belkasmi, M. and Farchane, A.}
}
@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.}
}
@conference {Saadane201262,
	title = {Evaluation of hybrid geo-location based on UMTS and GPS technologies},
	booktitle = {Proceedings of 2012 International Conference on Multimedia Computing and Systems, ICMCS 2012},
	year = {2012},
	note = {cited By 0},
	pages = {62-66},
	doi = {10.1109/ICMCS.2012.6320310},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869822901\&doi=10.1109\%2fICMCS.2012.6320310\&partnerID=40\&md5=98c5dfaf44a4e8614b501104ada67870},
	author = {Saadane, R. and Belkasmi, M. and El Koutbi, M. and Dadda, M.R.}
}
@conference {Azouaoui20121176,
	title = {A new genetic decoding of Linear Block Codes},
	booktitle = {Proceedings of 2012 International Conference on Multimedia Computing and Systems, ICMCS 2012},
	year = {2012},
	note = {cited By 2},
	pages = {1176-1182},
	doi = {10.1109/ICMCS.2012.6320254},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869797472\&doi=10.1109\%2fICMCS.2012.6320254\&partnerID=40\&md5=61049c5a211ceb9447427a9468114bf1},
	author = {Azouaoui, A. and Belkasmi, M.}
}
@article {Bouanani2012,
	title = {New results for Shannon capacity over generalized multipath fading channels with MRC diversity},
	journal = {Eurasip Journal on Wireless Communications and Networking},
	volume = {2012},
	number = {1},
	year = {2012},
	note = {cited By 7},
	doi = {10.1186/1687-1499-2012-336},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84975257524\&doi=10.1186\%2f1687-1499-2012-336\&partnerID=40\&md5=e634e3e8c1f8c11dd0447fbfa16245ef},
	author = {Bouanani, F.E. and Ben-Azza, H. and Belkasmi, M.}
}
@conference {Chana2011,
	title = {An efficient new soft-decision decoding algorithm for binary cyclic codes},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 4},
	doi = {10.1109/ICMCS.2011.5945580},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961236931\&doi=10.1109\%2fICMCS.2011.5945580\&partnerID=40\&md5=00f5f52d11fff70371c5fb428973b573},
	author = {Chana, I. and Allouch, H. and Belkasmi, M.}
}
@article {Berbia201135,
	title = {Genetic Algorithm for decoding linear codes over awgn and fading channels},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {30},
	number = {1},
	year = {2011},
	note = {cited By 0},
	pages = {35-41},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84860407864\&partnerID=40\&md5=032b7cf7b41aa626071a6c25b09716cf},
	author = {Berbia, H. and Elbouanani, F. and Romadi, R. and Benazza, H. and Belkasmi, M.}
}
@conference {Azouaoui2011,
	title = {A genetic algorithm to search of good double-circulant codes},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 2},
	doi = {10.1109/ICMCS.2011.5945582},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961229274\&doi=10.1109\%2fICMCS.2011.5945582\&partnerID=40\&md5=f33d2b1f9eced1a4a2448d6a0986b0d1},
	author = {Azouaoui, A. and Askali, M. and Belkasmi, M.}
}
@conference {Koudougnon2011,
	title = {Sphere decoding based on QR decomposition in STBC},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 1},
	doi = {10.1109/ICMCS.2011.5945624},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961243030\&doi=10.1109\%2fICMCS.2011.5945624\&partnerID=40\&md5=909487fa6b86a92432568997aba2bdb6},
	author = {Koudougnon, H. and Saadane, R. and Belkasmi, M.}
}
@conference {ElHaroussi2011,
	title = {VHDL design and FPGA implementation of weighted majority logic decoders},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 0},
	doi = {10.1109/ICMCS.2011.5945599},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961233273\&doi=10.1109\%2fICMCS.2011.5945599\&partnerID=40\&md5=07df2e3fcbba980a7e899b84c1e869ff},
	author = {El Haroussi, M. and Ayoub, F. and Belkasmi, M.}
}
@conference {Aouinatou2010,
	title = {Efficient anonymity for cock{\textquoteright}s scheme},
	booktitle = {2010 5th International Symposium on I/V Communications and Mobile Networks, ISIVC 2010},
	year = {2010},
	note = {cited By 0},
	doi = {10.1109/ISVC.2010.5656188},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651517817\&doi=10.1109\%2fISVC.2010.5656188\&partnerID=40\&md5=3716f9f5370c27dbe57da8eccadc6063},
	author = {Aouinatou, R. and Belkasmi, M.}
}
@article {Ayoub20102021,
	title = {Iterative decoding of generalized parallel concatenated OSMLD codes},
	journal = {Applied Mathematical Sciences},
	volume = {4},
	number = {41-44},
	year = {2010},
	note = {cited By 4},
	pages = {2021-2038},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77957011978\&partnerID=40\&md5=cbd626b2d840f6a619631feb064ba577},
	author = {Ayoub, F. and Belkasmi, M. and Chana, I.}
}
@conference {Koudougnon2010,
	title = {PAPR reduction using block coding combined with companding},
	booktitle = {2010 5th International Symposium on I/V Communications and Mobile Networks, ISIVC 2010},
	year = {2010},
	note = {cited By 0},
	doi = {10.1109/ISVC.2010.5656195},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651484205\&doi=10.1109\%2fISVC.2010.5656195\&partnerID=40\&md5=15b061fa94450a6529ed579ef2147ee8},
	author = {Koudougnon, H. and Chana, I. and Saadane, R. and Belkasmi, M.}
}
@conference {ElHaroussi2010,
	title = {VHDL design and FPGA implementation of a fully parallel BCH SISO decoder},
	booktitle = {2010 5th International Symposium on I/V Communications and Mobile Networks, ISIVC 2010},
	year = {2010},
	note = {cited By 0},
	doi = {10.1109/ISVC.2010.5656415},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651477175\&doi=10.1109\%2fISVC.2010.5656415\&partnerID=40\&md5=4ef5d844fa95aea85bc6781b1524b50e},
	author = {El Haroussi, M. and Chana, I. and Belkasmi, M.}
}
@article {Khafaji200923,
	title = {Impact of human bodies on millimetric bands propagation using ray tracing technique},
	journal = {Physical and Chemical News},
	volume = {50},
	year = {2009},
	note = {cited By 0},
	pages = {23-31},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-76749122475\&partnerID=40\&md5=b6be17acabeae92674dae2050eac6732},
	author = {Khafaji, A. and Saadane, R. and El Abbadi, J. and Belkasmi, M. and Farchi, A.}
}
@conference {Berbia2008667,
	title = {On the decoding of convolutional codes using genetic algorithms},
	booktitle = {Proceedings of the International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development},
	year = {2008},
	note = {cited By 1},
	pages = {667-671},
	doi = {10.1109/ICCCE.2008.4580688},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-52249083280\&doi=10.1109\%2fICCCE.2008.4580688\&partnerID=40\&md5=8a49644ba289981af8e55b689e45313e},
	author = {Berbia, H. and Belkasmi, M. and Elbouanani, F. and Ayoub, F.}
}
@conference {Elbouanani2008,
	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, ICTTA},
	year = {2008},
	note = {cited By 0},
	doi = {10.1109/ICTTA.2008.4530231},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-49149117177\&doi=10.1109\%2fICTTA.2008.4530231\&partnerID=40\&md5=d134accba4cf57685aeb683f384445e8},
	author = {Elbouanani, F. and Belkasmi, M. and Berbia, H.}
}
@conference {Berbia2008,
	title = {An enhanced genetic algorithm based decoder for linear codes},
	booktitle = {2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA},
	year = {2008},
	note = {cited By 0},
	doi = {10.1109/ICTTA.2008.4530229},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-49249093162\&doi=10.1109\%2fICTTA.2008.4530229\&partnerID=40\&md5=47847c552034bd508efbf07221f66c70},
	author = {Berbia, H. and Elbouanani, F. and Belkasmi, M. and Romadi, R.}
}
@conference {Belkasmi2008230,
	title = {Iterative decoding of parallel concatenated block codes},
	booktitle = {Proceedings of the International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development},
	year = {2008},
	note = {cited By 0},
	pages = {230-235},
	doi = {10.1109/ICCCE.2008.4580602},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-51849099065\&doi=10.1109\%2fICCCE.2008.4580602\&partnerID=40\&md5=2d5a54faa8647d8d5a1cc60bc598e1d8},
	author = {Belkasmi, M. and Farchane, A.}
}
@conference {Belkasmi2008,
	title = {Iterative decoding of product block codes based on the genetic algorithms},
	booktitle = {7th International ITG Conference on Source and Channel Coding, SCC 2008},
	year = {2008},
	note = {cited By 1},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84992523352\&partnerID=40\&md5=e3f8d2cabbbd62329972a0ce3b0b77d3},
	author = {Belkasmi, M. and Berbia, H. and El Bouanani, F.}
}
@conference { ISI:000256344200195,
	title = {Iterative threshold decoding of one step majority logic decodable block codes},
	booktitle = {2007 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, VOLS 1-3},
	year = {2007},
	note = {7th IEEE International Symposium on Signal Processing and Information Technology, Cairo, EGYPT, DEC 15-18, 2007},
	pages = {1059+},
	publisher = {IEEE; IEEE Signal Proc Soc; IEEE Comp Soc},
	organization = {IEEE; IEEE Signal Proc Soc; IEEE Comp Soc},
	abstract = {In this paper an iterative decoding of one step majority logic decodable (OSMLD) block codes is studied. We use a soft-in soft-out of APP threshold algorithm which is able to decode theses codes nearly as well as belief propagation (BP) algorithm. The Computation time of the proposed algorithm is very low and good performance results are obtained on both AWGN and Rayleigh fading channels. A comparison of the proposed algorithm and BP algorithm is also presented. We succeed to apply EXIT chart technique to our iterative process.},
	isbn = {978-1-4244-1834-3},
	author = {Lahmer, M. and Belkasmi, M. and Ayoub, F.}
}
