Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
Author(s) -
Dean Crnković,
Ronan Egan,
Andrea Švob
Publication year - 2019
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2020032
Subject(s) - mathematics , prime (order theory) , combinatorics , orbit (dynamics) , prime power , discrete mathematics , engineering , aerospace engineering
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom