An application of a virus optimization algorithm to the problem of computing binary self-dual and LCD codes
Adrian Korban, Serap Şahinkaya, Deniz Üstün · Advances in Mathematics of Communications · 2022
In this paper, we employ a virus optimization (VO) algorithm, which is one of the metaheuristic optimization techniques, and a known construction method to compute many new binary $ [72,36,12] $ self-dual codes and optimal/near-optimal linear complementary dual (LCD) codes. In particular, we obtain 39 Type Ⅰ and 19 Type Ⅱ codes of length 72, with parameters in their weight enumerators that were not known in the literature before, and 85 new binary LCD codes that are either optimal or near-optimal. We also present the generator matrix of extended Golay code $ [24,12,8] $ by a cyclic group matrix ring element.