Izvorni znanstveni članak
https://doi.org/10.21857/mwo1vczo8y
Codes from orbit matrices of strongly regular graphs
Dean Crnković
orcid.org/0000-0002-3299-7859
; Department of Mathematics, University of Rijeka, 51 000 Rijeka, Croatia
Marija Maksimović
orcid.org/0000-0002-8094-3724
; Department of Mathematics, University of Rijeka, 51 000 Rijeka, Croatia
Sanja Rukavina
orcid.org/0000-0003-3365-7925
; Department of Mathematics, University of Rijeka, 51 000 Rijeka, Croatia
Sažetak
We show that under certain conditions submatrices of orbit matrices of strongly regular graphs span self-orthogonal codes. In order to demonstrate this method of construction, we construct self-orthogonal binary linear codes from orbit matrices of the triangular graphs T(2k) with at most 120 vertices. Further, we obtain strongly regular graphs and block designs from codewords of the constructed codes.
Ključne riječi
Strongly regular graph; self-orthogonal code; block design
Hrčak ID:
206193
URI
Datum izdavanja:
28.9.2018.
Posjeta: 1.091 *