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
Recommendations
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)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- The CRC handbook of combinatorial designs
- Searching for linear codes with large minimum distance
- Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primitive symmetric designs with up to 2500 points
- Primitive rank 3 groups on symmetric designs
- 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
- The flag-transitive symmetric designs with 45 points, blocks of size 12, and 3 blocks on every point pair
- Rigidity theorems for a class of affine resolvable designs
- Self-orthogonal designs and codes from the symplectic groups S\(_4\)(3) and S\(_4\)(4)
- Some new results for optimal ternary linear codes
- Error-correcting codes from graphs
- The strongly regular (45,\,12,\,3,\,3) graphs
- Block designs and strongly regular graphs constructed from some linear and unitary groups
- Title not available (Why is that?)
Cited In (7)
- Isodual and Self-dual Codes from Graphs
- Binary codes from some \(2\)-\((64,28,12)\) designs and their orbit matrices
- Classes of self-orthogonal or self-dual codes from orbit matrices of Menon designs
- Binary codes of strongly regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
Uses Software
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)
