Bulletin of the
Korean Mathematical Society
BKMS
Article
ALL ARTICLES
View
Bull. Korean Math. Soc. 2017; 54(2): 497-505
Online first article March 20, 2017 Printed March 31, 2017
https://doi.org/10.4134/BKMS.b160122
Copyright © The Korean Mathematical Society.
Directed strongly regular graphs and their codes
Adel Alahmadi, Ahmad Alkenani, Jon-Lark Kim, Minjia Shi, and Patrick Sol\'{e}
King Abdulaziz University, King Abdulaziz University, Sogang University, Southeast University and School of Mathematical Sciences, University of Paris 8
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.
Keywords: adjacency matrix, directed graph, DSRG, error correcting code, SRG, strongly regular graph
MSC numbers: Primary 94B25, 05E30
Article Tools
Stats or Metrics
Share this article on :
Related articles in BKMS
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd