DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES

Citations

WEB OF SCIENCE

3
Citations

SCOPUS

3

초록

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.

키워드

adjacency matrixdirected graphDSRGerror correcting codeSRGstrongly regular graph
제목
DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES
저자
Alahmadi, AdelAlkenani, AhmadKim, Jon-LarkShi, MinjiaSole, Patrick
DOI
10.4134/BKMS.b160122
발행일
2017-03
유형
Article
저널명
대한수학회보
54
2
페이지
497 ~ 505