Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
Dean Crnković, Ronan Egan, Andrea Švob · Advances in Mathematics of Communications · 2019
In this paper we introduce the notion of orbit matrices of integer matrices such as Seidel and Laplacian matrices of some strongly regular graphs with respect to their permutation automorphism groups. We further show that under certain conditions these orbit matrices yield self-orthogonal codes over finite fields \begin{document}$ \mathbb{F}_q $\end{document} , where \begin{document}$ q $\end{document} is a prime power and over finite rings \begin{document}$ \mathbb{Z}_m $\end{document} . As a case study, we construct codes from orbit matrices of Seidel, Laplacian and signless Laplacian matrices of strongly regular graphs. In particular, we construct self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of the Higman-Sims and McLaughlin graphs.