Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs

Graphs and Combinatorics(2024)

引用 0|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
Deza graph,Directed Deza graph,Normally regular digraph,Orbit matrix,Self-orthogonal code,Hadamard matrix,94B05,05C20,05E18,05E30
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要