Show simple item record

dc.contributor.authorKorban, Adrian
dc.contributor.authorŞahinkaya, Serap
dc.contributor.authorUstun, Deniz
dc.date.accessioned2022-05-14T01:04:47Z
dc.date.available2022-05-14T01:04:47Z
dc.date.issued2022-05-01
dc.identifierdoi: 10.3934/amc.2022033
dc.identifier.citationKorban,A., Şahinkaya, S., & Ustun, D. (2022). A novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes. Advances in Mathematics of Communications. https://doi.org/10.3934/amc.2022033
dc.identifier.issn1930-5346
dc.identifier.doi10.3934/amc.2022033
dc.identifier.urihttp://hdl.handle.net/10034/626861
dc.descriptionThis article is not available on ChesterRep
dc.description.abstractIn 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.
dc.publisherAmerican Institute of Mathematical Sciences
dc.relation.urlhttps://www.aimsciences.org/article/doi/10.3934/amc.2022033
dc.sourcepissn: 1930-5346
dc.sourceeissn: 1930-5338
dc.subjectApplied Mathematics
dc.subjectDiscrete Mathematics and Combinatorics
dc.subjectComputer Networks and Communications
dc.subjectAlgebra and Number Theory
dc.subjectMicrobiology
dc.titleA novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes
dc.typeArticle
dc.identifier.eissn1930-5338
dc.contributor.departmentUniversity of Chester; Tarsus University
dc.identifier.journalAdvances in Mathematics of Communications
dc.date.updated2022-05-14T01:04:47Z


This item appears in the following Collection(s)

Show simple item record