Mohamed Azouazi
Hassan II University

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

A new efficient way based on special stabilizer multiplier permutations to attack the hardness of the minimum weight search problem for large BCH codes Issam Abderrahman Joundan; Said Nouh; Mohamed Azouazi; Abdelwahed Namir
International Journal of Electrical and Computer Engineering (IJECE) Vol 9, No 2: April 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (552.357 KB) | DOI: 10.11591/ijece.v9i2.pp1232-1239

Abstract

BCH codes represent an important class of cyclic error-correcting codes; their minimum distances are known only for some cases and remains an open NP-Hard problem in coding theory especially for large lengths. This paper presents an efficient scheme ZSSMP (Zimmermann Special Stabilizer Multiplier Permutation) to find the true value of the minimum distance for many large BCH codes. The proposed method consists in searching a codeword having the minimum weight by Zimmermann algorithm in the sub codes fixed by special stabilizer multiplier permutations. These few sub codes had very small dimensions compared to the dimension of the considered code itself and therefore the search of a codeword of global minimum weight is simplified in terms of run time complexity.  ZSSMP is validated on all BCH codes of length 255 for which it gives the exact value of the minimum distance. For BCH codes of length 511, the proposed technique passes considerably the famous known powerful scheme of Canteaut and Chabaud used to attack the public-key cryptosystems based on codes. ZSSMP is very rapid and allows catching the smallest weight codewords in few seconds. By exploiting the efficiency and the quickness of ZSSMP, the true minimum distances and consequently the error correcting capability of all the set of 165 BCH codes of length up to 1023 are determined except the two cases of the BCH(511,148) and BCH(511,259) codes. The comparison of ZSSMP with other powerful methods proves its quality for attacking the hardness of minimum weight search problem at least for the codes studied in this paper.
A survey of distance learning in Morocco during COVID19 Sara Ouahabi; Kamal El Guemmat; Mohamed Azouazi; Sanaa El Filali
Indonesian Journal of Electrical Engineering and Computer Science Vol 22, No 2: May 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v22.i2.pp1087-1095

Abstract

The face-to-face mode is always considered as the normal mode of teaching, and distance education is often understood as a remedy for the lack of material and human resources necessary to conduct training; but to prevent the spread of the coronavirus (COVID19), the distance course system has been launched in different countries to ensure continuity of teaching during the period when courses are stopped. In order to shed light on the role of distance learning during the spread of the coronavirus and its effectiveness in successfully continuing the learning process, an investigation was carried out in the Moroccan context. This survey was launched as a questionnaire with 565 participants; they are students and teachers from primary, secondary, university and professional training. The objective is to answer several research questions concerning the current use of distance education during the COVID19 pandemic. The results of this survey are presented in this article as well as their analysis showing that solutions and alternatives must be adopted in order to improve the teaching and learning process in the event of a situation like COVID19.