Seddiq El Kasmi Alaoui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Seddiq El Kasmi Alaoui has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Said Nouh
LTIM, Faculty of Sciences Ben M’Sick, Hassan II University of Casablanca, Casablanca 20360, Morocco
2 shared publications H. Faham
Hassan II University
1 shared publication- Khalid Kandali
Laboratory of Information Technology and Modeling (LTIM), TCA Team, Faculty of Sciences Ben M’Sick, Hassan II University of Casablanca, Casablanca 20360, Morocco, Morocco
1 shared publication - Khalid Moussaid
LIS Laboratory, Mathematics and Computer Science Department, Faculty of Sciences Aïn Chock, Hassan II University of Casablanca, Casablanca 20100, Morocco
1 shared publication M. El Assad
Hassan II University
1 shared publication- Mariam Mahdaoui
LTIM, Faculty of Sciences Ben M’Sick, Hassan II University of Casablanca, Casablanca 20360, Morocco
1 shared publication
Latest Publications
- Open Access
- 30 July 2026
- Published by MDPI AG in Information
- Vol. 17 (8) , 739
New Efficient Decoder of Linear Block Codes Based on Information Sets, Hash Techniques, and Machine Learning Models
Error-correcting codes improve the reliability of data exchanged between transmitters and receivers; achieving efficient and fast decoding is a major challenge. In this work, we propose an efficient, fast, and high-performing decoder named FastSyndISD. The first version of the proposed decoder uses hashing techniques to quickly find the information set that allows for error correction directly from the syndrome of the received word. Hashing information sets significantly reduce space complexity, instead of all correctable errors, compared to HSDec, LRDec, and EL-BoostDec. The second version utilizes a machine learning model (decision tree) to quickly find the information set that enables error correction directly from the syndrome of the received word. This second version does not require storing a hash table, since the information set is determined by a decision tree classifier model. The performance of the proposed decoder FastSyndISD is very encouraging regarding its bit error rate (BER). Indeed, it succeeds in correcting all errors whose weights are equal to or less than the correction capacity of the analyzed codes. Furthermore, a comparison with various other decoders highlights its effectiveness. A detailed study of its space complexity, its time complexity, and the factors influencing its performance has also been conducted, aiming to achieve an optimal BER while reducing computational time and memory usage. This comparison proves the significant success of the proposed decoder.
- 30 July 2026
- Published by MDPI AG in Information
- Vol. 17 (8) , 739
Open AccessNew Efficient Decoder of Linear Block Codes Based on Information Sets, Hash Techniques, and Machine Learning Models
Error-correcting codes improve the reliability of data exchanged between transmitters and receivers; achieving efficient and fast decoding is a major challenge. In this work, we propose an efficient, fast, and high-performing decoder named FastSyndISD. The first version of the proposed decoder uses hashing techniques to quickly find the information set that allows for error correction directly from the syndrome of the received word. Hashing information sets significantly reduce space complexity, instead of all correctable errors, compared to HSDec, LRDec, and EL-BoostDec. The second version utilizes a machine learning model (decision tree) to quickly find the information set that enables error correction directly from the syndrome of the received word. This second version does not require storing a hash table, since the information set is determined by a decision tree classifier model. The performance of the proposed decoder FastSyndISD is very encouraging regarding its bit error rate (BER). Indeed, it succeeds in correcting all errors whose weights are equal to or less than the correction capacity of the analyzed codes. Furthermore, a comparison with various other decoders highlights its effectiveness. A detailed study of its space complexity, its time complexity, and the factors influencing its performance has also been conducted, aiming to achieve an optimal BER while reducing computational time and memory usage. This comparison proves the significant success of the proposed decoder.
- Open Access
- 7 August 2025
- Published by MDPI AG in Information
- Vol. 16 (8) , 674
Automated Grading Method of Python Code Submissions Using Large Language Models and Machine Learning
Assessment is fundamental to programming education; however, it is a labour-intensive and complicated process, especially in extensive learning contexts where it relies significantly on human teachers. This paper presents an automated grading methodology designed to assess Python programming exercises, producing both continuous and discrete grades. The methodology incorporates GPT-4-Turbo, a robust large language model, and machine learning models selected by PyCaret’s automated process. The Extra Trees Regressor demonstrated superior performance in continuous grade prediction, with a Mean Absolute Error (MAE) of 4.43 out of 100 and an R2 score of 0.83. The Random Forest Classifier attained the highest scores for discrete grade classification, achieving an accuracy of 91% and a Quadratic Weighted Kappa of 0.84, indicating substantial concordance with human-assigned categories. These findings underscore the promise of integrating LLMs and automated model selection to facilitate scalable, consistent, and equitable assessment in programming education, while substantially alleviating the workload on human evaluators.
- 7 August 2025
- Published by MDPI AG in Information
- Vol. 16 (8) , 674
Open AccessAutomated Grading Method of Python Code Submissions Using Large Language Models and Machine Learning
Assessment is fundamental to programming education; however, it is a labour-intensive and complicated process, especially in extensive learning contexts where it relies significantly on human teachers. This paper presents an automated grading methodology designed to assess Python programming exercises, producing both continuous and discrete grades. The methodology incorporates GPT-4-Turbo, a robust large language model, and machine learning models selected by PyCaret’s automated process. The Extra Trees Regressor demonstrated superior performance in continuous grade prediction, with a Mean Absolute Error (MAE) of 4.43 out of 100 and an R2 score of 0.83. The Random Forest Classifier attained the highest scores for discrete grade classification, achieving an accuracy of 91% and a Quadratic Weighted Kappa of 0.84, indicating substantial concordance with human-assigned categories. These findings underscore the promise of integrating LLMs and automated model selection to facilitate scalable, consistent, and equitable assessment in programming education, while substantially alleviating the workload on human evaluators.
- 30 January 2024
- Published by Springer Nature
- p. 8-14
Performance Analysis of Two Serial Concatenations of Decoders Over a Rayleigh Channel
- 30 January 2024
- Published by Springer Nature
- p. 8-14
Performance Analysis of Two Serial Concatenations of Decoders Over a Rayleigh Channel
- 8 March 2023
- Published by Springer Nature
- p. 14-26
A Comprehensive Analysis of Novel Intrusion Detection Systems for Internet of Things Networks
- 8 March 2023
- Published by Springer Nature
- p. 14-26
A Comprehensive Analysis of Novel Intrusion Detection Systems for Internet of Things Networks