Self-orthogonal codes from row orbit matrices of strongly regular graphs

MaRDI QIDQ5218271zbMATH OpenFDO

Authors Marija Maksimović

Publication date 2 March 2020

zbMATH Keywords

block designself-orthogonal codestrongly regular graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05)

Recommendations

• Codes from orbit matrices of strongly regular graphs
• Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
• Self-orthogonal codes from orbit matrices of 2-designs

Cites work

• Binary codes of strongly regular graphs
• Codes and designs from triangular graphs and their line graphs
• Codes from orbit matrices of strongly regular graphs
• Constructing cospectral graphs
• scientific article; zbMATH DE number 3884175 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Permutation decoding for the binary codes from triangular graphs.
• Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• Strongly regular graphs with non-trivial automorphisms
• The Magma algebra system. I: The user language

Cited in

(10)

• Self-orthogonal codes from equitable partitions of association schemes
• Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
• Some optimal codes and strongly regular graphs from the linear group L₄(3)
• Some strongly regular graphs and self-orthogonal codes from the unitary group \(U_{4}(3)\)
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
• Codes from orbit matrices of strongly regular graphs
• scientific article; zbMATH DE number 6769199 (Why is no real title available?)
• Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
• Self-orthogonal codes from equitable partitions of distance-regular graphs

Describes a project that uses

Uses Software

• GAP
• Magma
• GRAPE

This page was built for publication: Self-orthogonal codes from row orbit matrices of strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218271)