Self-orthogonal codes from equitable partitions of distance-regular graphs
From MaRDI portal
Recommendations
- Self-orthogonal codes from equitable partitions of association schemes
- Codes from orbit matrices of strongly regular graphs
- Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
- 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
Cites work
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
- On the \(\mathrm{PSU}(4,2)\)-invariant vertex-transitive strongly regular \((216, 40, 4, 8)\) graph
- Quotients of association schemes
- Self-orthogonal codes from equitable partitions of association schemes
- Self-orthogonal codes from orbit matrices of 2-designs
- Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
- Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
- The Magma algebra system. I: The user language
- Transitive distance-regular graphs from linear groups L(3,q), q = 2,3,4,5
This page was built for publication: Self-orthogonal codes from equitable partitions of distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556572)
