Self-orthogonal codes from equitable partitions of distance-regular graphs
From MaRDI portal
Publication:6556572
DOI10.3934/AMC.2022014zbMATH Open1541.94076MaRDI QIDQ6556572
Andrea Švob, Dean Crnković, Sanja Rukavina
Publication date: 17 June 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Other types of codes (94B60)
Cites Work
- Title not available (Why is that?)
- Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
- Quotients of association schemes
- The Magma algebra system. I: The user language
- New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
- Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
- Self-orthogonal codes from orbit matrices of 2-designs
- Self-orthogonal codes from equitable partitions of association schemes
- On the \(\mathrm{PSU}(4,2)\)-invariant vertex-transitive strongly regular \((216, 40, 4, 8)\) graph
- Fundamentals of Error-Correcting Codes
- 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)
