An Application of the Virus Optimization Algorithm to the Problem of Finding Extremal Binary Self-Dual Codes
dc.authorid | https://orcid.org/0000-0002-5229-4018 | en_US |
dc.authorid | https://orcid.org/0000-0002-2084-6260 | en_US |
dc.authorscopusid | 36728602600 | en_US |
dc.authorscopusid | 55420759300 | en_US |
dc.contributor.author | Korban, Adrian | |
dc.contributor.author | Şahinkaya, Serap | |
dc.contributor.author | Üstün, Deniz | |
dc.date.accessioned | 2024-08-01T20:37:27Z | |
dc.date.available | 2024-08-01T20:37:27Z | |
dc.date.issued | 2021 | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.description.abstract | In this paper, a virus optimization algorithm, which is one of the metaheuristic optimization technique, is employed for the first time to the problem of finding extremal binary self-dual codes. We present a number of generator matrices of the form [I36 | τ3(v)], where I36 is the 36 × 36 identity matrix, v is an element in the group matrix ring M3(F2)G and G is a finite group of order 12, which we then employ together with the the virus optimization algorithm and the genetic algorithm to search for extremal binary self-dual codes of length 72. We obtain that the virus optimization algorithm finds more extremal binary self-dual codes than the genetic algorithm. Moreover, by employing the above mentioned constructions together with the virus optimization algorithm, we are able to obtain 39 Type I and 19 Type II codes of length 72, with parameters in their weight enumerators that were not known in the literature before. | en_US |
dc.identifier.citation | Korban, A., Sahinkaya, S. ve Üüstün, D. (2021), An Application of the Virus Optimization Algorithm to the Problem of Finding Extremal Binary Self-Dual Codes. ArXiv abs/2103.07739 | en_US |
dc.identifier.doi | 10.48550/arXiv.2103.07739 | en_US |
dc.identifier.issn | 1930-5346 | |
dc.identifier.scopus | 2-s2.0-85199279964 | |
dc.identifier.uri | https://doi.org/10.48550/arXiv.2103.07739 | |
dc.identifier.uri | https://hdl.handle.net/20.500.13099/323 | |
dc.identifier.wos | 000936053900001 | |
dc.identifier.wosquality | Q3 | |
dc.institutionauthor | Şahinkaya, Serap | |
dc.institutionauthor | Üstün, Deniz | |
dc.language.iso | eng | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | binary self-dual codes | en_US |
dc.subject | virus optimization algorithm | en_US |
dc.subject | metaheuristic optimization | en_US |
dc.subject | extremal codes | en_US |
dc.title | An Application of the Virus Optimization Algorithm to the Problem of Finding Extremal Binary Self-Dual Codes | en_US |
dc.type | article | en_US |
dcterms.publisher | American Institute of Mathematical Sciences | |
dcterms.source | Advances in Mathematics of Communications |