Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs

DOI10.1007/s00373-024-02763-yOpenAlexW4393045098MaRDI QIDQ6121920

Publication date: 26 March 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-024-02763-y

zbMATH Keywords

Hadamard matrix orbit matrix self-orthogonal code Deza graph normally regular digraph directed Deza graph

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Directed graphs (digraphs), tournaments (05C20) Group actions on combinatorial structures (05E18)

Cites Work

Unnamed Item
Strongly regular graphs with non-trivial automorphisms
A directed graph version of strongly regular graphs
Combinatorial properties of codes with degree \(n\)
On spectra of doubly regular asymmetric digraphs of \(RH\)-type
Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
On certain self-orthogonal AG codes with applications to quantum error-correcting codes
Enumeration of strictly Deza graphs with at most 21 vertices
New constructions of divisible design Cayley graphs
Galois self-orthogonal constacyclic codes over finite fields
Self-orthogonal codes from equitable partitions of association schemes
LCD codes and self-orthogonal codes in generalized dihedral group algebras
Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
An infinite family of Griesmer quasi-cyclic self-orthogonal codes
Walk-regular divisible design graphs
On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs
On strictly Deza graphs with parameters \((n, k, k - 1, a)\)
Normally regular digraphs, association schemes and related combinatorial structures
Divisible design graphs
Deza digraphs. II.
Deza digraphs
Self-orthogonal codes constructed from weakly self-orthogonal designs invariant under an action of \(M_{11}\)
Classification of binary self-orthogonal codes of lengths from 16 to 20 and its application
Construction of strongly regular graphs having an automorphism group of composite order
Divisible Design Digraphs
Searching for linear codes with large minimum distance
Deza graphs: A generalization of strongly regular graph
On Hulls of Some Primitive BCH Codes and Self-Orthogonal Codes
New MDS Euclidean Self-Orthogonal Codes
Deza graphs with parameters and

This page was built for publication: Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs