Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
From MaRDI portal
Publication:326339
DOI10.3934/AMC.2016026zbMATH Open1348.94096OpenAlexW2510934807MaRDI QIDQ326339FDOQ326339
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
Cites work
- scientific article; zbMATH DE number 51841 (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 2166507 (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?)
- 2-\((v,k,\lambda)\) designs of small order
- A class of majority logic decodable codes (Corresp.)
- Classification of regular two-graphs on 36 and 38 vertices
- Construction of block designs admitting an abelian automorphism group
- Directed \(t\)-packings and directed \(t\)-Steiner systems
- On the binary projective codes with dimension 6
- On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
- Optimal ternary linear codes
- Projective two-weight codes with small parameters and their corresponding graphs
- Rigidity theorems for a class of affine resolvable designs
- Self-orthogonal codes from orbit matrices of 2-designs
- 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 optimal codes and strongly regular graphs from the linear group \(L_4(3)\)
- Some optimal codes related to graphs invariant under the alternating group \(A_8\)
- Strongly regular graphs with non-trivial automorphisms
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- The Magma algebra system. I: The user language
- The strongly regular (40, 12, 2, 4) graphs
Cited in
(17)- New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
- Self-orthogonal codes from equitable partitions of distance-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
- Quadratic residue codes, rank three groups and PBIBDs
- Some optimal codes and strongly regular graphs from the linear group \(L_4(3)\)
- Self-orthogonal codes from equitable partitions of association schemes
- Isodual and self-dual codes from graphs
- Codes from orbit matrices of strongly regular graphs
- Some strongly regular graphs and self-orthogonal codes from the unitary group \(U_{4}(3)\)
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- scientific article; zbMATH DE number 7640089 (Why is no real title available?)
- Strongly regular graphs with parameters \((37, 18, 8, 9)\) having nontrivial automorphisms
- Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
- On self-orthogonal designs and codes related to Held's simple group
- Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
- scientific article; zbMATH DE number 6769199 (Why is no real title available?)
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)
