Self-orthogonal codes from the strongly regular graphs on up to 40 vertices

DOI10.3934/amc.2016026zbMath1348.94096OpenAlexW2510934807MaRDI QIDQ326339

Sanja Rukavina, Marija Maksimović, Bernardo Gabriel Rodrigues, Dean Crnković

Publication date: 12 October 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2016026

zbMATH Keywords

strongly regular graphcodeblock designorbit matrix

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Combinatorial codes (94B25)

Related Items

Unnamed Item ⋮ Isodual and Self-dual Codes from Graphs ⋮ New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\) ⋮ Unnamed Item ⋮ Strongly regular graphs with parameters (37, 18, 8, 9) having nontrivial automorphisms ⋮ Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs ⋮ Unnamed Item ⋮ Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group ⋮ Quadratic residue codes, rank three groups and PBIBDs ⋮ Self-orthogonal codes from equitable partitions of association schemes

Uses Software

• Magma
• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly regular graphs with non-trivial automorphisms
• On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
• Construction of block designs admitting an abelian automorphism group
• Projective two-weight codes with small parameters and their corresponding graphs
• Self-orthogonal designs and codes from the symplectic groups S\(_4\)(3) and S\(_4\)(4)
• Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
• Optimal ternary linear codes
• The Magma algebra system. I: The user language
• Directed \(t\)-packings and directed \(t\)-Steiner systems
• Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
• Self-orthogonal codes from orbit matrices of 2-designs
• The strongly regular (40, 12, 2, 4) graphs
• Some optimal codes related to graphs invariant under the alternating group \(A_8\)
• On the binary projective codes with dimension 6
• A class of majority logic decodable codes (Corresp.)

This page was built for publication: Self-orthogonal codes from the strongly regular graphs on up to 40 vertices