default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmed Azouaoui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Rajaa Sliman, Ahmed Azouaoui:
Tifinagh Handwritten Character Recognition Using the Convolutional Neural Network. WINCOM 2024: 1-5- 2022
- [j3]Hicham Grari
, Khalid Zine-Dine, Ahmed Azouaoui, Siham Lamzabi:
Deep Learning-Based Cryptanalysis of a Simplified AES Cipher. Int. J. Inf. Secur. Priv. 16(1): 1-16 (2022)
2010 – 2019
- 2018
- [j2]Lahcen Niharmine, Hicham Bouzkraoui, Ahmed Azouaoui, Youssef Hadi:
Simulated Annealing Decoder for Linear Block Codes. J. Comput. Sci. 14(8): 1174-1189 (2018) - [c10]Hicham Bouzkraoui, Ahmed Azouaoui, Youssef Hadi:
New ant colony optimization for searching the minimum distance for linear codes. CommNet 2018: 1-6 - [c9]Hicham Grari, Ahmed Azouaoui, Khalid Zine-Dine:
Breaking LFSR using ant colony optimization. CommNet 2018: 1-6 - [c8]Lahcen Niharmine, Benaceur Outtaj, Ahmed Azouaoui:
Tifinagh handwritten character recognition using genetic algorithms. CommNet 2018: 1-6 - [c7]Noria Tahiri, Ahmed Azouaoui, Mostafa Belkasmi:
A novel detector based on the compact genetic algorithm for MIMO systems. CommNet 2018: 1-6 - 2017
- [c6]Soufian Addi, Ahlam Berkani, Ahmed Azouaoui, Mostafa Belkasmi:
New hard decision decoder of LDPC codes using single Bit Flipping algorithm. WINCOM 2017: 1-5 - 2016
- [c5]Hamza Boualame, Noria Tahiri, Idriss Chana, Ahmed Azouaoui, Mostafa Belkasmi:
An efficient soft decision decoding algorithm using cyclic permutations and compact genetic algorithm. ACOSIS 2016: 1-6 - [c4]Hicham Grari, Ahmed Azouaoui, Khalid Zine-Dine:
A Novel Ant Colony Optimization Based Cryptanalysis of Substitution Cipher. AECIA 2016: 180-187 - 2015
- [c3]Ahlam Berkani, Ahmed Azouaoui, Mostafa Belkasmi, Bouchaib Aylaj:
Compact Genetic Algorithms with larger tournament size for soft-decision decoding. ISDA 2015: 623-628 - [c2]Ahlam Berkani, Ahmed Azouaoui, Mostafa Belkasmi:
Soft-decision decoding by a compact genetic algorithm using higher selection pressure. WINCOM 2015: 1-6 - [i3]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
- [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
- [j1]Ahmed Azouaoui, Mostafa Belkasmi, Abderrazak Farchane:
Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms. J. Electr. Comput. Eng. 2012: 503834:1-503834:12 (2012) - [c1]Ahmed Azouaoui, Mostafa Belkasmi:
A new genetic decoding of Linear Block Codes. ICMCS 2012: 1176-1182 - [i1]Ahmed Azouaoui, Ahlam Berkani, Mostafa Belkasmi:
An Efficient Soft Decoder of Block Codes Based on Compact Genetic Algorithm. CoRR abs/1211.3384 (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 2024-09-26 01:51 CEST 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:
