The adjacency codes of the first yellow graphs
From MaRDI portal
Recommendations
Cites work
- A new distance-regular graph of diameter 3 on 1024 vertices
- Additive perfect codes in Doob graphs
- Binary codes of strongly regular graphs
- Conditions for the parameters of the block graph of quasi-symmetric designs
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3880742 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3497777 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On repeated-root cyclic codes
- On Self-Dual Cyclic Codes Over Finite Fields
- On the coset graph construction of distance-regular graphs
- On two-weight \(\mathbb {Z}_{2^k}\)-codes
- Spectra of graphs
- Strongly regular graphs
- Strongly regular graphs from reducible cyclic codes
- Strongly regular graphs with non-trivial automorphisms
- The Geometry of Two-Weight Codes Over ℤpm
- The Magma algebra system. I: The user language
- Three-weight codes over rings and strongly walk regular graphs
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- Two families of two-weight codes over \(\mathbb{Z}_4\)
This page was built for publication: The adjacency codes of the first yellow graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6594947)
