On tight 4-designs in Hamming association schemes
classification
🧮 math.CO
keywords
tightassociationdesignshammingopenschemesanalyzearrays
read the original abstract
We complete the classification of tight $4$-designs in Hamming association schemes $H(n,q)$, i.e., that of tight orthogonal arrays of strength $4$, which had been open since a result by Noda (1979). To do so, we construct an association scheme attached to a tight $4$-design in $H(n,q)$ and analyze its triple intersection numbers to conclude the non-existence in all open cases.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.