Pregled bibliografske jedinice broj: 906393
Self-orthogonal codes from the strongly regular graphs
Self-orthogonal codes from the strongly regular graphs // Colloquium on Combinatorics
Paderborn, Njemačka, 2016. str. 24-24 (predavanje, međunarodna recenzija, sažetak, znanstveni)
CROSBI ID: 906393 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Self-orthogonal codes from the strongly regular graphs
Autori
Maksimović, Marija ; Crnković, Dean ; Rodrigues, Bernardo ; Rukavina, Sanja
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, znanstveni
Izvornik
Colloquium on Combinatorics
/ - , 2016, 24-24
Skup
Colloquium on Combinatorics
Mjesto i datum
Paderborn, Njemačka, 04.11.2016. - 05.11.2016
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Strongly regular graph ; block design ; code ; orbit matrix
Sažetak
In this talk we will outline a method for constructing self-orthogonal codes from orbit matrices. We consider orbit matrices of strongly regular graphs admitting an automorphism group G which acts with orbits of length w, where w divides |G|. We apply this method to construct self-orthogonal codes from orbit and adjacency matrices of the strongly regular graphs with at most 40 vertices. In particular, we consider graphs with parameters (36, 15, 6, 6), (36, 14, 4, 6), (35, 16, 6, 8), (40, 12, 2, 4) and their complements. That completes the classification of self-orthogonal codes spanned by the adjacency matrices or orbit matrices of the strongly regular graphs with at most 40 vertices. Some of the obtained codes are optimal, and some are best known for the given length and dimension.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
HRZZ-IP-2013-11-1637 - Kodovi i s njima povezane kombinatoričke strukture (CoCoS) (Crnković, Dean, HRZZ - 2013-11) ( CroRIS)
Ustanove:
Sveučilište u Rijeci, Fakultet za matematiku