본문 바로가기
KERD
논문KCI 등재

Directed strongly regular graphs and their codes

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

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.

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.

참고문헌 (10)

  1. E. F. Assmus, "Designs and their Codes" (1994)
  2. A. E. Brouwer, "On the p-rank of the adjacency matrices of strongly regular graphs", J. Algebraic Combin, 1(4), pp.329~346 (1992)
  3. A. E. Brouwer, "Spectra of Graphs" (2012), Springer
  4. A. M. Duval, "A directed graph version of strongly regular graphs", J. Comb. Th. Ser. A, 47(1), pp.71~100 (1988)
  5. C. D. Godsil, "Representations of directed strongly regular graphs", European J. Combin, 28(7), pp.1980~1993 (2007)
  6. W. H. Haemers, "Binary codes of strongly regular graphs", Des. Codes and Cryptography, 17(1-3), pp.187~209 (1999)
  7. W. C. Huffman, "Fundamentals of Error Correcting Codes" (2003)
  8. J.-L. Kim, "Skew Hadamard designs and their codes", Des. Codes and Cryptography, 49(1-3), pp.135~145 (2008)

관련 논문AI추천

이 간행물의 다른 논문 (27건)