Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

A new efficient decoder of linear block codes based on ensemble learning methods

IAES International Journal of Artificial Intelligence · Vol. 13 No. 2 (2024) · hlm. 2236–2246

DOI
10.11591/ijai.v13.i2.pp2236-2246
ISSN
2252-8938, 2089-4872
Terbit
2024-06-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

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.

Kata kunci

Jaringan kolaborasi para penulis

28 penulis · 77 tautan kepenulisan bersama · 9 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • University of Hassan II Casablanca
  • Mohammed V University
  • Abdelmalek Essaâdi University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Abdelali ZakraniUniversity of Hassan II Casablanca4
El Mehdi BellfkihUniversity of Hassan II Casablanca4
Zouhair ChibaUniversity of Hassan II Casablanca3
Hamza FahamUniversity of Hassan II Casablanca3
Salsabila BenghazouaniUniversity of Hassan II Casablanca2
Jamal Eddine RafiqUniversity of Hassan II Casablanca2
Mohammed AmraouyMohammed V University2
Mostafa BelkasmiMohammed V University2
Abdelaziz MarzakUniversity of Hassan II Casablanca2
Imrane Chemseddine IdrissiAfiliasi tidak diketahui2
Khalid LouartitiAbdelmalek Essaâdi University2
Jamal MoulineAfiliasi tidak diketahui2
Issam Abderrahman JoundanUniversity of Hassan II Casablanca1
Mohamed AzouaziUniversity of Hassan II Casablanca1
Abdelwahed NamirUniversity of Hassan II Casablanca1
Ihsane HaloumUniversity of Hassan II Casablanca1
Mostafa JebbarUniversity of Hassan II Casablanca1
Abdellah BennaneMohammed V University1
El mehdi LghaouchUniversity of Hassan II Casablanca1
Fatima Zahra AbbourUniversity of Hassan II Casablanca1
Soumaya OunacerUniversity of Hassan II Casablanca1
Soufiane ArdchirUniversity of Hassan II Casablanca1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A new efficient decoder of linear block codes based on ensemble learning methods</dc:title>
	<dc:creator>El Assad, Mohammed</dc:creator>
	<dc:creator>Nouh, Said</dc:creator>
	<dc:creator>Chemseddine Idrissi, Imrane</dc:creator>
	<dc:creator>El Kasmi Alaoui, Seddiq</dc:creator>
	<dc:creator>Aylaj, Bouchaib</dc:creator>
	<dc:creator>Azzouazi, Mohamed</dc:creator>
	<dc:subject xml:lang="en-US"></dc:subject>
	<dc:subject xml:lang="en-US">BCH codes; Boosting; Ensemble learning methods; Error correcting codes; Quadratic residue codes; Syndrome decoding</dc:subject>
	<dc:description xml:lang="en-US">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.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2024-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/23997</dc:identifier>
	<dc:identifier>10.11591/ijai.v13.i2.pp2236-2246</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 13, No 2: June 2024; 2236-2246</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v13.i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/23997/14026</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>