engleski

The construction of combinatorial structures and linear codes from orbit matrices of strongly regular graphs

Orbit matrices of strongly regular graphs were introduced in 2011 by M. Behbahani and C. Lam [1]. A method for constructing self-orthogonal codes from orbit matrices of strongly regular graphs admitting an automorphism group G which acts with orbits of length w, where w divides |G| is given in [2]. In this talk we will present the construction of some combinatorial structures and linear codes from orbit matrices of strongly regular graphs and their submatrices. REFERENCES: [1] M. Behbahani, C. Lam, Strongly regular graphs with non-trivial automorphisms, Discrete Math., 311, 132--144, 2011. [2] D. Crnković, M. Maksimović, B. G. Rodrigues, S. Rukavina, Self-orthogonal codes from the strongly regular graphs on up to 40 vertices, Adv. Math. Commun., 10, 555--582, 2016.

combinatorial structure ; linear code ; orbit matrix

nije evidentirano