Back to Search
Start Over
Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs.
- Source :
-
Graphs & Combinatorics . Apr2024, Vol. 40 Issue 2, p1-12. 12p. - Publication Year :
- 2024
-
Abstract
- In this paper, we give constructions of self-orthogonal codes from orbit matrices of Deza graphs, normally regular digraphs and Deza digraphs in terms of a definition given by Wang and Feng. These constructions can also be applied to adjacency matrices of the mentioned graphs. Since a lot of constructions of Deza graphs, normally regular digraphs and Deza digraphs in the sense of Wang and Feng have been known, the methods presented in this paper give us a rich source of matrices that span self-orthogonal codes. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 40
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 176263267
- Full Text :
- https://doi.org/10.1007/s00373-024-02763-y