The construction of combinatorial structures and linear codes from orbit matrices of strongly regular graphs (CROSBI ID 654985)
Prilog sa skupa u zborniku | sažetak izlaganja sa skupa | međunarodna recenzija
Podaci o odgovornosti
Rukavina, Sanja ; Crnković, Dean
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. Bibliography [1] M. Behbahani, C. Lam, Strongly regular graphs with non-trivial automorphisms, Discrete Math., 311 (2011), 132-144 . [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 (2016), 555-582.
combinatorial structure ; linear code
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
53-53.
2017.
objavljeno
Podaci o matičnoj publikaciji
Hypergraphs, Graphs and Designs HyGraDe 2017
Sant’Alessio Siculo, Italy:
Podaci o skupu
Hypergraphs, Graphs and Designs - HyGraDe 2017
predavanje
20.06.2017-24.06.2017
Sant'Alessio Siculo, Italija