Tight 2-designs and perfect 1-codes in Doob graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3492731 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 475371 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Four fundamental parameters of a code and their combinatorial significance
- On Orthogonal Arrays of Strength 4 Achieving Rao's Bound
- On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\)
- Perfect codes in graphs
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
Cited in
(9)- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- On the number of maximum independent sets in Doob graphs
- MDS codes in Doob graphs
- Additive perfect codes in Doob graphs
- On the minimum supports of some eigenfunctions in the Doob graphs
- A characterization of the Doob graphs
- Distance-2 MDS codes and Latin colorings in the Doob graphs
- Perfect codes in Doob graphs
This page was built for publication: Tight 2-designs and perfect 1-codes in Doob graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569871)
