default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaïd Nouh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j3]El Mehdi Bellfkih
, Saïd Nouh, Imrane Chems Eddine Idrissi, Khalid Louartiti, Jamal Mouline:
Genetic Algorithm-Based Method for Discovering Involutory MDS Matrices. Comput. Math. Methods 2023: 5951901:1-5951901:8 (2023)- 2021
- [j2]My Seddiq El Kasmi Alaoui, Saïd Nouh:
Decoding Algorithm by Cooperation Between Hartmann Rudolph Algorithm and a Decoder Based on Syndrome and Hash. Int. J. Nat. Comput. Res. 10(1): 15-27 (2021) - 2013
- [j1]Saïd Nouh, Idriss Chana, Mostafa Belkasmi:
Decoding of Block Codes by using Genetic Algorithms and Permutations Set. Int. J. Commun. Networks Inf. Secur. 5(3) (2013)
Conference and Workshop Papers
- 2023
- [c7]El Mehdi Bellfkih, Saïd Nouh, Imrane Chems Eddine Idrissi, Khalid Louartiti, Jamal Mouline:
Genetic Algorithm-Based Approach for Discovering Involutory MDS Matrices. SITA 2023: 1-6 - [c6]Imrane Chems Eddine Idrissi, Saïd Nouh, El Mehdi Bellfkih, Abdelaziz Marzak, Mohammed El Assad Assad:
Error-Correcting Codes and the Power of Machine Learning: Enhancing Data Reliability. SITA 2023: 1-6 - 2022
- [c5]Bouchaib Aylaj, Saïd Nouh:
Degeneration vs Classical of simulated annealing algorithm: performance analysis. CommNet 2022: 1-5 - 2021
- [c4]Mariam Mahdaoui, Saïd Nouh, My Seddiq Elkasmi Alaoui, Mounir Sadiq:
Comparative study between automatic hint generation approaches in Intelligent Programming Tutors. EUSPN/ICTH 2021: 391-396 - 2016
- [c3]Issam Abderrahman Joundan, Saïd Nouh, Abdelwahed Namir:
Design of good linear codes for a decoder based on majority voting procedure. ACOSIS 2016: 1-6 - [c2]Karim Rkizat, Mohammed Lahmer, Mostafa Belkasmi, Saïd Nouh:
Construction and iterative threshold decoding for low rates Quasi-Cyclic One Step Majority logic decodable codes. ACOSIS 2016: 1-7 - 2012
- [c1]Mohamed Askali, Saïd Nouh, Mostafa Belkasmi:
An efficient method to find the minimum distance of linear block codes. ICMCS 2012: 318-324
Informal and Other Publications
- 2015
- [i5]Mohamed Askali, Saïd Nouh, Ahmed Azouaoui, Mostafa Belkasmi:
Discovery of good double and triple circulant codes using multiple impulse method. CoRR abs/1509.03243 (2015) - 2013
- [i4]Abderrazak Farchane, Mostafa Belkasmi, Saïd Nouh:
Generalized parallel concatenated block codes based on BCH and RS codes, construction and Iterative decoding. CoRR abs/1303.4224 (2013) - [i3]Saïd Nouh, Mostafa Belkasmi:
Genetic algorithms for finding the weight enumerator of binary linear block codes. CoRR abs/1303.4227 (2013) - [i2]Mohamed Askali, Ahmed Azouaoui, Saïd Nouh, Mostafa Belkasmi:
On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods. CoRR abs/1303.4375 (2013) - 2012
- [i1]Saïd Nouh, Bouchaib Aylaj, Mostafa Belkasmi:
A Method to determine Partial Weight Enumerator for Linear Block Codes. CoRR abs/1212.6086 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
