Directed strongly regular graphs and their codes
Bull. Korean Math. Soc. 2017 Vol. 54, No. 2, 497-505
https://doi.org/10.4134/BKMS.b160122
Published online March 31, 2017
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
Abstract : 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
Downloads: Full-text PDF  


Copyright © Korean Mathematical Society. All Rights Reserved.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd