engleski

Self-orthogonal codes constructed from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs

In this talk we introduce the notion of orbit matrices of integer matrices such as Hadamard matrices, 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 Fq, where q is a prime power and over finite rings Zm. 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