Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
DOI10.3934/AMC.2016026zbMATH Open1348.94096OpenAlexW2510934807MaRDI QIDQ326339FDOQ326339
Authors: Dean Crnković, Marija Maksimović, B. G. Rodrigues, Sanja Rukavina 
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
Recommendations
- Codes from orbit matrices of strongly regular graphs
- Self-orthogonal codes from row orbit matrices of strongly regular graphs
- Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
- 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
Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Combinatorial codes (94B25)
Cites Work
- The Magma algebra system. I: The user language
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
- Self-orthogonal codes from orbit matrices of 2-designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Construction of block designs admitting an abelian automorphism group
- Title not available (Why is that?)
- On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
- Projective two-weight codes with small parameters and their corresponding graphs
- Optimal ternary linear codes
- Directed \(t\)-packings and directed \(t\)-Steiner systems
- 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
- Rigidity theorems for a class of affine resolvable designs
- Classification of regular two-graphs on 36 and 38 vertices
- Some optimal codes and strongly regular graphs from the linear group \(L_4(3)\)
- 2-\((v,k,\lambda)\) designs of small order
- Title not available (Why is that?)
- Title not available (Why is that?)
- A class of majority logic decodable codes (Corresp.)
- Strongly regular graphs with non-trivial automorphisms
- Self-orthogonal designs and codes from the symplectic groups S\(_4\)(3) and S\(_4\)(4)
Cited In (14)
- Self-orthogonal codes from equitable partitions of distance-regular graphs
- 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_4(3)\)
- Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
- Title not available (Why is that?)
- Isodual and Self-dual Codes from Graphs
- Quadratic residue codes, rank three groups and PBIBDs
- New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
- Some strongly regular graphs and self-orthogonal codes from the unitary group \(U_{4}(3)\)
- Strongly regular graphs with parameters (37, 18, 8, 9) having nontrivial automorphisms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-orthogonal codes from equitable partitions of association schemes
- Title not available (Why is that?)
Uses Software
This page was built for publication: Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326339)
