Mutation-Based Algebraic Artificial Bee Colony Algorithm for Computing the Distance of Linear Codes

Basit Öğe Kaydı
dc.authoridhttps://orcid.org/0000-0002-5229-4018
dc.authoridhttps://orcid.org/0000-0002-2084-6260
dc.authorscopusid55420759300
dc.authorscopusid36728602600
dc.authorwosidABB-4228-2020
dc.authorwosidGQB-3301-2022
dc.contributor.authorÜstün, Deniz
dc.contributor.authorŞahinkaya, Serap
dc.contributor.authorKorban, Adrian
dc.date.accessioned2024-07-31T14:03:38Z
dc.date.available2024-07-31T14:03:38Z
dc.date.issued2022
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü
dc.description.abstractFinding the minimum distance of linear codes is a non-deterministic polynomial-time-hard problem and different approaches are used in the literature to solve this problem. Although, some of the methods focus on finding the true distances by using exact algorithms, some of them focus on optimization algorithms to find the lower or upper bounds of the distance. In this study, we focus on the latter approach. We first give the swarm intelligence background of artificial bee colony algorithm, we explain the algebraic approach of such algorithm and call it the algebraic artificial bee colony algorithm (A-ABC). Moreover, we develop the A-ABC algorithm by integrating it with the algebraic differential mutation operator. We call the developed algorithm the mutation-based algebraic artificial bee colony algorithm (MBA-ABC). We apply both; the A-ABC and MBA-ABC algorithms to the problem of finding the minimum distance of linear codes. The achieved results indicate that the MBA-ABC algorithm has a superior performance when compared with the A-ABC algorithm when finding the minimum distance of Bose, Chaudhuri, and Hocquenghem (BCH) codes (a special type of linear codes).
dc.identifier.citationKorban, A., Şahinkaya, S., ve Üstün, D. (2022). Mutation-Based Algebraic Artificial Bee Colony Algorithm for Computing the Distance of Linear Codes. Turkish Journal of Mathematics and Computer Science, 14(1), 191-200. Erişim adresi: https://doi.org/10.47000/tjmcs.982426
dc.identifier.doi10.47000/tjmcs.982426
dc.identifier.endpage200en_US
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-85202052670
dc.identifier.startpage191en_US
dc.identifier.trdizinid1117727
dc.identifier.urihttps://doi.org/10.47000/tjmcs.982426
dc.identifier.urihttps://doi.org/10.47000/tjmcs.982426
dc.identifier.urihttps://hdl.handle.net/20.500.13099/308
dc.identifier.volume14en_US
dc.indekslendigikaynakTR-Dizin
dc.institutionauthorÜstün, Deniz
dc.institutionauthorŞahinkaya, Serap
dc.language.isoen
dc.publisherDergipark
dc.relation.ispartofTurkish Journal of Mathematics and Computer Science
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectMinimum distance
dc.subjectminimum-weight codeword
dc.subjectoptimisation
dc.subjectheuristic
dc.subjectartificial bee colony algorithm
dc.titleMutation-Based Algebraic Artificial Bee Colony Algorithm for Computing the Distance of Linear Codes
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
10.47000-tjmcs.982426-1923383.pdf
Boyut:
3.05 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası
İndir
Lisans paketi
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
TR-Dizin İndeksli Yayınlar Koleksiyonu