engleski

Codes 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. Further, we will discuss codes constructed 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.

graph ; seidel matrix ; Laplacian matrix

nije evidentirano