Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

New family of error-correcting codes based on genetic algorithms

IAES International Journal of Artificial Intelligence · Vol. 14 No. 2 (2025) · hlm. 1077–1086

DOI
10.11591/ijai.v14.i2.pp1077-1086
ISSN
2252-8938, 2089-4872
Terbit
2025-04-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

This paper introduces a novel error-correcting code (ECC) construction and decoding approach utilizing genetic algorithms (GAs). Classical ECCs often struggle with efficiency in correcting multiple errors due to time-consuming matrix-based encoding and decoding processes. Our GA-based method optimizes generator vectors to maximize the minimum distance between codewords, enhancing error correction capabilities. Specifically, we construct a new family of ECCs with code length 31, dimension 12, and minimum distance 7, reducing complexity from O(kn) to O(k(n−k)) by encoding message blocks with vectors instead of matrices. In the decoding phase, the GA effectively corrects errors in received codewords. Experimental results show that at a signal-to-noise ratio (SNR) of 7.7 dB, our method achieves a bit error rate (BER) of 10−5 after only 9 generations of the GA. These results demonstrate improved error correction and decoding performance compared to traditional methods. This study contributes an innovative approach using GAs for error correction, offering simpler encoding and robust performance in coding schemes.

Kata kunci

Jaringan kolaborasi para penulis

26 penulis · 70 tautan kepenulisan bersama · 11 lintas organisasi

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

  • University of Hassan II Casablanca
  • Abdelmalek Essaâdi University
  • Mohammed V 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
Mohammed El AssadUniversity of Hassan II Casablanca5
Abdelali ZakraniUniversity of Hassan II Casablanca4
Seddiq El Kasmi AlaouiUniversity of Hassan II Casablanca3
Bouchaib AylajAfiliasi tidak diketahui3
Salsabila BenghazouaniUniversity of Hassan II Casablanca2
Jamal Eddine RafiqUniversity of Hassan II Casablanca2
Mohammed AmraouyMohammed V University2
Abdelaziz MarzakUniversity of Hassan II Casablanca2
Imrane Chemseddine IdrissiAfiliasi tidak diketahui2
Mohamed AzzouaziUniversity of Hassan II Casablanca2
Issam Abderrahman JoundanUniversity of Hassan II Casablanca1
Mohamed AzouaziUniversity of Hassan II Casablanca1
Abdelwahed NamirUniversity of Hassan II Casablanca1
Zouhair ChibaUniversity of Hassan II Casablanca1
Hamza FahamUniversity of Hassan II Casablanca1
Ihsane HaloumUniversity of Hassan II Casablanca1
Mostafa JebbarUniversity of Hassan II Casablanca1
Abdellah BennaneMohammed V University1
Mostafa BelkasmiMohammed V University1
Zineb El AtmaniAbdelmalek Essaâdi University1
Mourad MadraneAbdelmalek Essaâdi University1

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">New family of error-correcting codes based on genetic algorithms</dc:title>
	<dc:creator>Bellfkih, El Mehdi</dc:creator>
	<dc:creator>Nouh, Said</dc:creator>
	<dc:creator>Chemseddine Idrissi, Imrane</dc:creator>
	<dc:creator>Louartiti, Khalid</dc:creator>
	<dc:creator>Mouline, Jamal</dc:creator>
	<dc:subject xml:lang="en-US"></dc:subject>
	<dc:subject xml:lang="en-US">Decoding; Design; Error-correcting codes; Generator vector; Genetic algorithm; Minimum distance;</dc:subject>
	<dc:description xml:lang="en-US">This paper introduces a novel error-correcting code (ECC) construction and decoding approach utilizing genetic algorithms (GAs). Classical ECCs often struggle with efficiency in correcting multiple errors due to time-consuming matrix-based encoding and decoding processes. Our GA-based method optimizes generator vectors to maximize the minimum distance between codewords, enhancing error correction capabilities. Specifically, we construct a new family of ECCs with code length 31, dimension 12, and minimum distance 7, reducing complexity from O(kn) to O(k(n−k)) by encoding message blocks with vectors instead of matrices. In the decoding phase, the GA effectively corrects errors in received codewords. Experimental results show that at a signal-to-noise ratio (SNR) of 7.7 dB, our method achieves a bit error rate (BER) of 10−5 after only 9 generations of the GA. These results demonstrate improved error correction and decoding performance compared to traditional methods. This study contributes an innovative approach using GAs for error correction, offering simpler encoding and robust performance in coding schemes.</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>2025-04-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/24699</dc:identifier>
	<dc:identifier>10.11591/ijai.v14.i2.pp1077-1086</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 14, No 2: April 2025; 1077-1086</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v14.i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/24699/14434</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 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>