On the classification of binary completely transitive codes with almost-simple top-group

DOI10.1016/J.EJC.2022.103604MaRDI QIDQ2080231zbMATH OpenOpenAlexFDO

Authors Robert F. Bailey, Daniel R. Hawtin

Publication date 7 October 2022

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.08436

zbMATH Keywords

automorphism group completely transitive code Hamming graph

Mathematics Subject Classification ID

Group actions on combinatorial structures (05E18) Other types of codes (94B60)

Abstract: A code

C

in the Hamming metric, that is, is a subset of the vertex set

V v a r G a m m a

of the Hamming graph

v a r G a m m a = H (m, q)

, gives rise to a natural distance partition

C, C_{1}, l d o t s, C_{h} o

, where

h o

is the covering radius of

C

. Such a code

C

is called completely transitive if the automorphism group

m A u t (C)

acts transitively on each of the sets

C

,

C_{1}

, ldots,

C_{h} o

. A code

C

is called

2

-neighbour-transitive if

h o g e q 2

and

m A u t (C)

acts transitively on each of

C

,

C_{1}

and

C_{2}

. Let

C

be a completely transitive code in a binary (

q = 2

) Hamming graph having full automorphism group

m A u t (C)

and minimum distance

d e l t a g e q 5

. Then it is known that

m A u t (C)

induces a

2

-homogeneous action on the coordinates of the vertices of the Hamming graph. The main result of this paper classifies those

C

for which this induced

2

-homogeneous action is not an affine, linear or symplectic group. We find that there are

13

such codes,

4

of which are non-linear codes. Though most of the codes are well-known, we obtain several new results. First, a new non-linear completely transitive code is constructed, as well as a related non-linear code that is

2

-neighbour-transitive but not completely transitive. Moreover, new proofs of the complete transitivity of several codes are given. Additionally, we answer the question of the existence of distance-regular graphs related to the completely transitive codes appearing in our main result.

Review text

In this paper, the authors were interested in the classification of binary completely transitive codes with almost-simple top-group. A code in this paper is a subset of the vertex set of the Hamming graph. The authors are interested in a particular classes of these codes i.e. completely transitive codes i.e. subfamily of completely regular codes. Characterisation of certain families of neighbour-transitive codes in Hamming graphs have been known before as well as some classification results of subfamilies of neighbour-transitive codes in Johnson graphs. The main result provide the classification of binary completely transitive codes having minimum distance at least 5 and particular automorphism group, described in the paper. Further, the authors were interested in distance-regular graphs related to these codes.

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

This page was built for publication: On the classification of binary completely transitive codes with almost-simple top-group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2080231)