Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs (CROSBI ID 283817)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Crnković, Dean ; Egan, Ronan ; Švob, Andrea
engleski
Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
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 $\mathbb{;F};_q$, where $q$ is a prime power and over finite rings $\mathbb{;Z};_m$. 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.
Strongly regular graph, Seidel matrix, Laplacian matrix, orbit matrix, self-orthogonal code
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
14 (4)
2020.
591-602
objavljeno
1930-5346
1930-5338
10.3934/amc.2020032