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

TL;DR

This paper classifies 2-neighbour-transitive codes with small blocks of imprimitivity in the Hamming graph, especially those with minimum distance at least 5, extending understanding beyond affine actions.

Contribution

It provides a classification of 2-neighbour-transitive codes with small blocks of imprimitivity and minimum distance at least 5, including a subclass of completely transitive codes.

Findings

Classified 2-neighbour-transitive codes with small blocks of imprimitivity.

Extended classification to include completely transitive codes with these properties.

Identified conditions under which codes are either 2-neighbour-transitive or completely transitive.

Abstract

A code $C$ in the Hamming graph $\varGamma=H(m,q)$ is $2\it{\text{-neighbour-transitive}}$ if ${\rm Aut}(C)$ acts transitively on each of $C=C_0$, $C_1$ and $C_2$, the first three parts of the distance partition of $V\varGamma$ with respect to $C$. Previous classifications of families of $2$-neighbour-transitive codes leave only those with an affine action on the alphabet to be investigated. Here, $2$-neighbour-transitive codes with minimum distance at least $5$ and that contain "small" subcodes as blocks of imprimitivity are classified. When considering codes with minimum distance at least $5$, completely transitive codes are a proper subclass of $2$-neighbour-transitive codes. Thus, as a corollary of the main result, completely transitive codes satisfying the above conditions are also classified.