Tight 2-designs and perfect 1-codes in Doob graphs
DOI10.1016/S0378-3758(99)00126-3zbMATH Open0974.05011OpenAlexW2008192074WikidataQ127185659 ScholiaQ127185659MaRDI QIDQ1569871FDOQ1569871
Authors: Jack H. Koolen, Akihiro Munemasa 
Publication date: 13 September 2001
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-3758(99)00126-3
Recommendations
Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Other types of codes (94B60)
Cites Work
- Title not available (Why is that?)
- Perfect codes in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
- Four fundamental parameters of a code and their combinatorial significance
- Title not available (Why is that?)
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- Title not available (Why is that?)
- On Orthogonal Arrays of Strength 4 Achieving Rao's Bound
- 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\)
Cited In (9)
- Additive perfect codes in Doob graphs
- Distance-2 MDS codes and Latin colorings in the Doob graphs
- A characterization of the Doob graphs
- Perfect codes in Doob graphs
- 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 minimum supports of some eigenfunctions in the Doob graphs
- MDS codes in Doob graphs
- On the number of maximum independent sets in Doob graphs
Uses Software
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)
