[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/BKMS.b160122

DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES

Alahmadi, Adel (Department of Mathematics King Abdulaziz University)
Alkenani, Ahmad (Department of Mathematics King Abdulaziz University)
Kim, Jon-Lark (Department of Mathematics Sogang University)
Shi, Minjia (Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University)
Sole, Patrick (CNRS/LAGA University of Paris 8)

Publication Information

Bulletin of the Korean Mathematical Society / v.54, no.2, 2017 , pp. 497-505 More about this Journal

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;

Citations & Related Records

Reference

1	E. F. Assmus and J. E. Key, Designs and their Codes, Cambridge, 1994.
2	A. E. Brouwer and C. A. van Eijl, On the p-rank of the adjacency matrices of strongly regular graphs, J. Algebraic Combin. 1 (1992), no. 4, 329-346. DOI
3	A. E. Brouwer and W. H. Haemers, Spectra of Graphs, Springer, 2012.
4	A. M. Duval, A directed graph version of strongly regular graphs, J. Comb. Th. Ser. A 47 (1988), no. 1, 71-100. DOI
5	M. Grassl, www.codetables.de.
6	C. D. Godsil, S. A. Hobart, and W. J. Martin, Representations of directed strongly regular graphs, European J. Combin. 28 (2007), no. 7, 1980-1993. DOI
7	W. H. Haemers, R. Peeters, and J. M. van Rijckevorsel, Binary codes of strongly regular graphs, Des. Codes and Cryptography 17 (1999), no. 1-3, 187-209. DOI
8	http://homepages.cwi.nl/-aeb/math/dsrg/dsrg.html
9	W. C. Huffman and V. Pless, Fundamentals of Error Correcting Codes, Cambridge, 2003.
10	J.-L. Kim and P. Sole, Skew Hadamard designs and their codes, Des. Codes and Cryptography 49 (2008), no. 1-3, 135-145. DOI