@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 {Azougaghe2021348,
	title = {Comparative Study on the McEliece Public-Key Cryptosystem Based on Goppa and QC-MDPC Codes},
	journal = {Lecture Notes in Business Information Processing},
	volume = {416 LNBIP},
	year = {2021},
	note = {cited By 0},
	pages = {348-360},
	abstract = {In recent years, much research has been conducted on quantum computers {\textendash} machine that exploit the phenomena of quantum mechanics to solve difficult or insoluble mathematical problems for conventional computers. If large-scale quantum computers are built, they will be able to break many of the public key cryptosystems currently in use. This would seriously compromise the confidentiality and integrity of digital communications on the internet. Post-quantum cryptography aims to develop secure cryptographic systems against both conventional as well as quantum computers for interacting with existing protocols and communication networks. In this paper we present a public key cryptosystem of McEliece based on the correcting codes, using two types of correcting codes; QC-MDPC and Goppa correcting codes. This latter seems very interesting considering its two characteristics, namely the power of correction and the efficient decoding algorithm which resistant to quantum attacks due to difficulty of decoding a linear code. On the other hand, QC-MDPC cryptosystem code is rapid and more secure than Goppa cryptosystem. {\textcopyright} 2021, Springer Nature Switzerland AG.},
	keywords = {Conventional computers, Cryptographic systems, Decoding, Digital communication systems, Digital communications, Information analysis, Large scale quantum computers, Mathematical problems, McEliece public-key cryptosystem, Network security, Post quantum cryptography, Public key cryptography, Public key cryptosystems, Quantum cryptography, Quantum theory, Qubits},
	doi = {10.1007/978-3-030-76508-8_25},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85111125773\&doi=10.1007\%2f978-3-030-76508-8_25\&partnerID=40\&md5=e1b3a760dc5546ca8c452d1b973aa5fe},
	author = {Azougaghe, E.-S. and Farchane, A. and Tazigh, I. and Azougaghe, A.}
}
@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.}
}
@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.}
}
@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 {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.}
}
