Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs

DOI10.1016/J.DISC.2012.06.012zbMATH Open1251.94047OpenAlexW2025826533MaRDI QIDQ456889FDOQ456889

Authors Dean Crnković, Sanja Rukavina, Loredana Simčić, B. G. Rodrigues

Publication date 16 October 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.06.012

zbMATH Keywords

strongly regular graphcombinatorial designlinear ternary code

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial codes (94B25)

Recommendations

• Binary codes of strongly regular graphs
• Self-orthogonal codes from row orbit matrices of strongly regular graphs
• Some new results for ternary linear codes of dimension 5 and 6
• Two new optimal ternary two-weight codes and strongly regular graphs
• Ternary codes from graphs on triples

Cites work

• scientific article; zbMATH DE number 3790437 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• scientific article; zbMATH DE number 140063 (Why is no real title available?)
• scientific article; zbMATH DE number 1228817 (Why is no real title available?)
• scientific article; zbMATH DE number 1284417 (Why is no real title available?)
• scientific article; zbMATH DE number 638668 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• scientific article; zbMATH DE number 775176 (Why is no real title available?)
• Block designs and strongly regular graphs constructed from some linear and unitary groups
• Error-correcting codes from graphs
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
• Primitive rank 3 groups on symmetric designs
• Primitive symmetric designs with up to 2500 points
• Rigidity theorems for a class of affine resolvable designs
• Searching for linear codes with large minimum distance
• Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
• Self-orthogonal designs and codes from the symplectic groups S\(_4\)(3) and S\(_4\)(4)
• Some new results for optimal ternary linear codes
• The CRC handbook of combinatorial designs
• The Magma algebra system. I: The user language
• The flag-transitive symmetric designs with 45 points, blocks of size 12, and 3 blocks on every point pair
• The strongly regular (45,\,12,\,3,\,3) graphs

Cited in

(12)

• Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
• Enumeration of symmetric \((45,12,3)\) designs with nontrivial automorphisms
• Self-orthogonal codes from row orbit matrices of strongly regular graphs
• Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
• Classes of self-orthogonal or self-dual codes from orbit matrices of Menon designs
• Isodual and self-dual codes from graphs
• Codes from orbit matrices of strongly regular graphs
• Binary codes of strongly regular graphs
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• Linear ternary codes of strongly regular signed graphs
• Binary codes from some \(2\)-\((64,28,12)\) designs and their orbit matrices

Describes a project that uses

Uses Software

• Magma
• nauty
• Code Tables

This page was built for publication: Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs

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