A novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes
dc.authorid | https://orcid.org/0000-0002-2084-6260 | en_US |
dc.authorid | https://orcid.org/0000-0002-5229-4018 | en_US |
dc.authorscopusid | 57206665622 | en_US |
dc.authorscopusid | 55420759300 | en_US |
dc.authorscopusid | 36728602600 | en_US |
dc.authorwosid | DWJ-0396-2022 | en_US |
dc.authorwosid | ABB-4228-2020 | en_US |
dc.authorwosid | GQB-3301-2022 | en_US |
dc.contributor.author | Korban, Adrian | |
dc.contributor.author | Şahinkaya, Serap | |
dc.contributor.author | Üstün, Deniz | |
dc.date.accessioned | 2024-08-01T11:29:45Z | |
dc.date.available | 2024-08-01T11:29:45Z | |
dc.date.issued | 2022 | 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 genetic algorithm, one of the evolutionary algorithm optimization methods, is used for the first time for the problem of computing extremal binary self-dual codes. We present a comparison of the computational times between the genetic algorithm and a linear search for different size search spaces and show that the genetic algorithm is capable of computing binary self-dual codes significantly faster than the linear search. Moreover, by employing a known matrix construction together with the genetic algorithm, we are able to obtain new binary self-dual codes of lengths 68 and 72 in a significantly short time. In particular, we obtain 11 new binary self-dual codes of length 68 and 17 new binary self-dual codes of length 72. | en_US |
dc.identifier.citation | Korban A., Şahinkaya S., Ustun D. (2024). A novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes. Advances in Mathematics of Communications, 18 (4), 892 - 908. Doi: 10.3934/amc.2022033 | en_US |
dc.identifier.doi | 10.3934/amc.2022033 | en_US |
dc.identifier.endpage | 908 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.scopus | 2-s2.0-85196850913 | en_US |
dc.identifier.startpage | 892 | en_US |
dc.identifier.uri | https://www.aimsciences.org/article/doi/10.3934/amc.2022033?viewType=HTML | |
dc.identifier.uri | https://hdl.handle.net/20.500.13099/311 | |
dc.identifier.volume | 18 | en_US |
dc.identifier.wos | 000793032000001 | en_US |
dc.identifier.wosquality | Q3 | en_US |
dc.institutionauthor | Şahinkaya, Serap | |
dc.institutionauthor | Üstün, Deniz | |
dc.language.iso | eng | en_US |
dc.publisher | American Institute of Mathematical Sciences (AIMS) | en_US |
dc.relation.ispartof | Advances in Mathematics of Communications | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/restrictedAccess | en_US |
dc.subject | Self-dual codes | en_US |
dc.subject | evolutionary algorithms | en_US |
dc.subject | genetic search scheme | en_US |
dc.subject | group rings | en_US |
dc.title | A novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes | en_US |
dc.type | article | en_US |