On tight $4$-designs in Hamming association schemes
Combinatorics
2019-07-17 v2
Abstract
We complete the classification of tight -designs in Hamming association schemes , i.e., that of tight orthogonal arrays of strength , which had been open since a result by Noda (1979). To do so, we construct an association scheme attached to a tight -design in and analyze its triple intersection numbers to conclude the non-existence in all open cases.
Cite
@article{arxiv.1809.07553,
title = {On tight $4$-designs in Hamming association schemes},
author = {Alexander Gavrilyuk and Sho Suda and Janoš Vidali},
journal= {arXiv preprint arXiv:1809.07553},
year = {2019}
}