Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
From MaRDI portal
Publication:456889
DOI10.1016/j.disc.2012.06.012zbMath1251.94047OpenAlexW2025826533MaRDI QIDQ456889
Loredana Simčić, Sanja Rukavina, Dean Crnković, Bernardo Gabriel 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
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial codes (94B25)
Related Items
Isodual and Self-dual Codes from Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Classes of self-orthogonal or self-dual codes from orbit matrices of Menon designs ⋮ Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Self-orthogonal designs and codes from the symplectic groups S\(_4\)(3) and S\(_4\)(4)
- The Magma algebra system. I: The user language
- Error-correcting codes from graphs
- Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
- 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
- Primitive symmetric designs with up to 2500 points
- Searching for linear codes with large minimum distance
- Some new results for optimal ternary linear codes
- Primitive rank 3 groups on symmetric designs
