Apart from being an interesting and exciting area in combinatorics with beautiful results,
finite projective spaces or Galois geometries have many applications to coding theory …

We use a theorem of Guralnick, Penttila, Praeger, and Saxl to classify the subgroups of the
general linear group (of a finite dimensional vector space over a finite field) which are …

1 Finite classical polar spaces Page 1 i In: Current research topics in Galois geometry Editor:
L. Storme, pp. 33-58 ISBN 0000000000 c 2010 Nova Science Publishers, Inc. Chapter 2 …

Let P be a finite classical polar space of rank d. An m-regular system with respect to (k− 1)-
dimensional projective spaces of P, 1≤ k≤ d− 1, is a set R of generators of P with the …

On m-ovoids of finite classical polar spaces with an irreducible transitive automorphism group
Page 1 SCIENCE CHINA Mathematics https://doi.org/10.1007/s11425-021-2060-3 c Science …

Polar spaces over finite fields are fundamental in combinatorial geometry. The concept of
polar space was firstly introduced by F. Veldkamp who gave a system of 10 axioms in the …

This is a chapter in a forthcoming book on completely regular codes in distance regular
graphs. The chapter provides an overview, and some original results, on codes in distance …

Hyperovals on H(3,q2) Page 1 Journal of Combinatorial Theory, Series A 118 (2011) 1190–1195
Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series A www.elsevier.com/locate/jcta …

A code C in a generalised quadrangle Q is defined to be a subset of the vertex set of the
point-line incidence graph Γ of Q. The minimum distance δ of C is the smallest distance …