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

Autori
Rukavina, Sanja

Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, znanstveni

Izvornik
Symmetry vs. Regularity, Abstracts / Ivanov, Alexandar A. ; Klin, Mikhail ; Munemasa, Akihiro ; Nedela, Roman - Plzeň : Union of Czech Mathematicians and Physicists and Universiy of West Bohemia in Pilzen, 2018, 54-54

ISBN
978-80-261-0806-1

Skup
Symmetry vs Regularity

Mjesto i datum
Plzeň, Češka Republika, 01.07.2018. - 07.07.2018

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
combinatorial structure ; linear code ; orbit matrix

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA