9 citations · 25 across the 7 of their papers we have counts for
7 papers
On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods
Mohamed Askali, Ahmed Azouaoui, Saïd Nouh +1
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this…
Genetic algorithms for finding the weight enumerator of binary linear block codes
Said Nouh, Mostafa Belkasmi
In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight…
Generalized parallel concatenated block codes based on BCH and RS codes, construction and Iterative decoding
Abderrazzak Farchane, Mostafa Belkasmi, Said Nouh
In this paper, a generalization of parallel concatenated block GPCB codes based on BCH and RS codes is presented.
A Method to determine Partial Weight Enumerator for Linear Block Codes
Said Nouh, Bouchaib Aylaj, Mostafa Belkasmi
In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo meth…
An Efficient Soft Decoder of Block Codes Based on Compact Genetic Algorithm
Ahmed Azouaoui, Ahlam Berkani, Mostafa Belkasmi
Soft-decision decoding is NP-hard problem of great interest to developers of communication system. We present an efficient soft-decision decoding of linear block codes based on com…
Iterative decoding of Generalized Parallel Concatenated Block codes using cyclic permutations
Hamid Allouch, Idriss Chana, Mostafa Belkasmi
Iterative decoding techniques have gain popularity due to their performance and their application in most communications systems. In this paper, we present a new application of our…