DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES
Adel N. Alahmadi, Ahmad N. Al‐Kenani, Jon-Lark Kim, Minjia Shi, Patrick Solé · Bulletin of the Korean Mathematical Society · 2017
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.