Alahmadi, Adel; Alkenani, Ahmad; Kim, Jon-Lark; Shi, Minjia; Solé, Patrick Directed strongly regular graphs and their codes. (English) Zbl 1370.94588 Bull. Korean Math. Soc. 54, No. 2, 497-505 (2017). Summary: The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum. Cited in 1 Document MSC: 94B25 Combinatorial codes 05E30 Association schemes, strongly regular graphs Keywords:adjacency matrix; directed graph; DSRG; error correcting code; SRG; strongly regular graph PDFBibTeX XMLCite \textit{A. Alahmadi} et al., Bull. Korean Math. Soc. 54, No. 2, 497--505 (2017; Zbl 1370.94588) Full Text: DOI