TY - JOUR

T1 - Alphabet-almost-simple 2-neighbour-transitive codes

AU - Gillespie, Neil I.

AU - Hawtin, Daniel R.

PY - 2018

Y1 - 2018

N2 - Let X be a subgroup of the full automorphism group of the Hamming graph H(m, q), and C a subset of the vertices of the Hamming graph. We say that C is an (X, 2)-neighbour-transitive code if X is transitive on C, as well as C1 and C2, the sets of vertices which are distance 1 and 2 from the code. It has been shown that, given an (X, 2)-neighbour-transitive code C, there exists a subgroup of X with a 2-transitive action on the alphabet; this action is thus almost-simple or affine. This paper completes the classification of (X, 2)-neighbour-transitive codes, with minimum distance at least 5, where the subgroup of X stabilising some entry has an almost-simple action on the alphabet in the stabilised entry. The main result of this paper states that the class of (X, 2) neighbour-transitive codes with an almost-simple action on the alphabet and minimum distance at least 3 consists of one infinite family of well known codes.

AB - Let X be a subgroup of the full automorphism group of the Hamming graph H(m, q), and C a subset of the vertices of the Hamming graph. We say that C is an (X, 2)-neighbour-transitive code if X is transitive on C, as well as C1 and C2, the sets of vertices which are distance 1 and 2 from the code. It has been shown that, given an (X, 2)-neighbour-transitive code C, there exists a subgroup of X with a 2-transitive action on the alphabet; this action is thus almost-simple or affine. This paper completes the classification of (X, 2)-neighbour-transitive codes, with minimum distance at least 5, where the subgroup of X stabilising some entry has an almost-simple action on the alphabet in the stabilised entry. The main result of this paper states that the class of (X, 2) neighbour-transitive codes with an almost-simple action on the alphabet and minimum distance at least 3 consists of one infinite family of well known codes.

KW - 2-neighbour-transitive

KW - Alphabet-almost-simple

KW - Automorphism groups

KW - Completely transitive

KW - Hamming graph

UR - http://www.scopus.com/inward/record.url?scp=85032748086&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85032748086

SN - 1855-3974

VL - 14

SP - 345

EP - 357

JO - Ars Mathematica Contemporanea

JF - Ars Mathematica Contemporanea

IS - 2

ER -