New type I binary $[72, 36, 12]$ self-dual codes from $M_6(\mathbb{F}_2)G$ - Group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm
Adrian Korban, Serap Şahinkaya, Deniz Üstün · Advances in Mathematics of Communications · 2022
In this paper, a new search technique based on a virus optimisation algorithm is proposed for calculating the neighbours of binary self-dual codes. The aim of this new technique is to calculate neighbours of self-dual codes without reducing the search field in the search process (this technique is known in the literature due to the computational time constraint) but still obtaining results in a reasonable time (significantly faster when compared to the standard linear computational search). We employ this new search algorithm to the well-known neighbour method and its extension, the \begin{document}$ k^{th} $\end{document} -range neighbours, and search for binary \begin{document}$ [72, 36, 12] $\end{document} self-dual codes. In particular, we present six generator matrices of the form \begin{document}$ [I_{36} \ | \ \tau_6(v)], $\end{document} where \begin{document}$ I_{36} $\end{document} is the \begin{document}$ 36 \times 36 $\end{document} identity matrix, \begin{document}$ v $\end{document} is an element in the group matrix ring \begin{document}$ M_6(\mathbb{F}_2)G $\end{document} and \begin{document}$ G $\end{document} is a finite group of order 6, to which we employ the proposed algorithm and search for binary \begin{document}$ [72, 36, 12] $\end{document} self-dual codes directly over the finite field \begin{document}$ \mathbb{F}_2 $\end{document} . We construct 1471 new Type I binary \begin{document}$ [72, 36, 12] $\end{document} self-dual codes with the rare parameters \begin{document}$ \gamma = 11, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 32 $\end{document} in their weight enumerators.