Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph

Alexandr Valyuzhenich

The Hamming graph $H(n,q)$ is the graph whose vertices are the words of length $n$ over the alphabet $\{0,1,\dots ,q-1\}$, where two vertices are adjacent if they differ in exactly…