×

Directed strongly regular graphs and their codes. (English) Zbl 1370.94588

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.

MSC:

94B25 Combinatorial codes
05E30 Association schemes, strongly regular graphs
PDFBibTeX XMLCite
Full Text: DOI