$2$-Neighbour-Transitive Codes with Small Blocks of Imprimitivity

Neil I. Gillespie, Daniel R. Hawtin, Cheryl E. Praeger

A code $C$ in the Hamming graph $\Gamma =H(m,q)$ is $2\text{-neighbour-transitive}$ if $\mathrm{Aut}(C)$ acts transitively on each of $C=C_0$, $C_1$ and $C_2$, the first three…