Sign in
Back
DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES
Journal article   Open access  Peer reviewed

DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES

Adel Alahmadi, Ahmad Alkenani, Jon-Lark Kim, Minjia Shi and Patrick Sole
Taehan Suhakhoe hoebo, Vol.54(2), pp.497-505
01/03/2017
DOI: https://doi.org/10.4134/BKMS.b160122

Abstract

Mathematics Physical Sciences Science & Technology
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.
url
https://doi.org/10.4134/BKMS.b160122View
Published (Version of record) Open

Metrics

1 Record Views

Details