Maximal $m$-distance sets containing the representation of the Hamming graph $H(n,m)$

Saori Adachi, Rina Hayashi, Hiroshi Nozaki +1

A set $X$ in the Euclidean space ${\mathbb{R}}^d$ is called an $m$-distance set if the set of Euclidean distances between two distinct points in $X$ has size $m$. An $m$-distance set…