Claim Missing Document
Check
Articles

Found 2 Documents
Search

A new efficient decoder of linear block codes based on ensemble learning methods El Assad, Mohammed; Nouh, Said; Chemseddine Idrissi, Imrane; El Kasmi Alaoui, Seddiq; Aylaj, Bouchaib; Azzouazi, Mohamed
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 13, No 2: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v13.i2.pp2236-2246

Abstract

Error-correcting codes are used to partially or completely correct errors as much as possible, while ensuring high transmission speeds. Several machine learning models such as logistic regression and decision tree have been applied to correct transmission errors. Among the most powerful machine learning techniques are aggregation methods which have yielded to excellent results in many areas of research. It is this excellence that has prompted us to consider their application for the hard decoding problem. In this sense, we have successfully designed, tested and validated our proposed EL-BoostDec decoder (hard decision decoder based on ensemble learning-boosting technique) which is based on computing of the syndrome of the received word and on using ensemble learning techniques to find the corresponding corrigible error. The obtained results with EL-BoostDec are very encouraging in terms of the binary error rate (BER) that it offers. Practically EL-BoostDec has succeed to correct 100% of errors that have weights less than or equal to the correction capability of studied codes. The comparison of EL-BoostDec with many competitors proves its power. A study of parameters which impact on EL-BoostDec performances has been established to obtain a good BER with minimum run time complexity.
Optimal design, decoding, and minimum distance analysis of Goppa codes using heuristic method Aylaj, Bouchaib; Nouh, Said; Belkasmi, Mostafa
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5411-5421

Abstract

Error-correcting codes are crucial to ensure data reliability in communication systems often affected by transmission noise. Building on previous successful applications of our heuristic method degenerate quantum simulated annealing (DQSA) to Bose–Chaudhuri–Hocquenghem (BCH) and quadratic residue (QR) codes. This paper proposes two algorithms designed to address two coding problems for Goppa codes. DQSA-dmin computes the minimum distance (dmin) while DQSA-Dec, serves as a hard decoder optimized for additive white gaussian noise (AWGN) channels. We validate DQSA-dmin comparing its computed minimum distances with theoretical estimates for algebraically constructed Goppa codes, showing accuracy and efficiency. DQSA-dmin further used to find the optimal Goppa codes that reach the lower bound of dmin for linear codes known in the literature and stored in Marcus Grassl's online database. Indeed, we discovered 12 Goppa codes reaching this lower bound. For DQSA-Dec, experimental results show that it obtains a bit error rate (BER) of 10-5 when SNR=7.5 for codes with lengths less than 65, which is very interesting for a hard decoder. Additionally, a comparison with the Paterson algebraic decoder specific to this code family shows that DQSA-Dec outperforms it with a 0.6 dB coding gain at BER=10-4. These findings highlight the effectiveness of DQSA-based algorithms in designing and decoding Goppa codes.