Neighbour-transitive codes and partial spreads in generalised quadrangles

Group actions on combinatorial structures (05E18) Generalized quadrangles and generalized polygons in finite geometry (51E12) Combinatorial codes (94B25)

Abstract: A code

C

in a generalised quadrangle

m a t h c a l Q

is defined to be a subset of the vertex set of the point-line incidence graph

v a r G a m m a

of

m a t h c a l Q

. The minimum distance

d e l t a

of

C

is the smallest distance between a pair of distinct elements of

C

. The graph metric gives rise to the distance partition

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

, where

h o

is the maximum distance between any vertex of

v a r G a m m a

and its nearest element of

C

. Since the diameter of

v a r G a m m a

is

4

, both

h o

and

d e l t a

are at most

4

. If

d e l t a = 4

then

C

is a partial ovoid or partial spread of

m a t h c a l Q

, and if, additionally,

h o = 2

then

C

is an ovoid or a spread. A code

C

in

m a t h c a l Q

is neighbour-transitive if its automorphism group acts transitively on each of the sets

C

and

C_{1}

. Our main results i) classify all neighbour-transitive codes admitting an insoluble group of automorphisms in thick classical generalised quadrangles that correspond to ovoids or spreads, and ii) give two infinite families and six sporadic examples of neighbour-transitive codes with minimum distance

d e l t a = 4

in the classical generalised quadrangle

{m a t h s f W}_{3} (q)

that are not ovoids or spreads.

Recommendations

Cites work

Cited in

(4)

Describes a project that uses

Uses Software

This page was built for publication: Neighbour-transitive codes and partial spreads in generalised quadrangles

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