Korban, AdrianŞahinkaya, SerapÜstün, Deniz2024-08-012024-08-012021Korban, 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.077391930-5346https://doi.org/10.48550/arXiv.2103.07739https://hdl.handle.net/20.500.13099/323In 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.enginfo:eu-repo/semantics/openAccessbinary self-dual codesvirus optimization algorithmmetaheuristic optimizationextremal codesarticle10.48550/arXiv.2103.07739Q30009360539000012-s2.0-85199279964