Generalised dual arcs and Veronesean surfaces, with applications to cryptography

We start by defining generalised dual arcs, the motivation for defining them comes from cryptography, since they can serve as a tool to construct authentication codes and secret sharing schemes. We extend the characterisation of the tangent planes of the Veronesean surface in PG(5,q), q odd, described in [J.W.P. Hirschfeld, J.A. Thas, General Galois Geometries, Oxford Math. Monogr., Clarendon Press/Oxford Univ. Press, New York, 1991], as a set of q²+q+1 planes in PG(5,q), such that every two intersect in a point and every three are skew. We show that a set of q²+q planes generating PG(5,q), q odd, and satisfying the above properties can be extended to a set of q²+q+1 planes still satisfying all conditions. This result is a natural generalisation of the fact that a q-arc in PG(2,q), q odd, can always be extended to a (q+1)-arc. This extension result is then used to study a regular generalised dual arc with parameters (9,5,2,0) in PG(9,q), q odd, where we obtain an algebraic characterisation of such an object as being the image of a cubic Veronesean.     

Coprimitive sets and inextendable codes

Complete (n,r)-arcs in PG(k−1,q) and projective (n,k,n−r) _q -codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable length admit only projective extensions. Thus, we are able to prove the maximality of many known linear codes. At the same time our results sharply limit the possibilities for constructing long non-linear codes. We also show that certain short linear codes are maximal. The methods here may be just as interesting as the results. They are based on the Bruen–Silverman model of linear codes (see Alderson TL (2002) PhD. Thesis, University of Western Ontario; Alderson TL (to appear) J Combin Theory Ser A; Bruen AA, Silverman R (1988) Geom Dedicata 28(1): 31–43; Silverman R (1960) Can J Math 12: 158–176) as well as the theory of Rédei blocking sets first introduced in Bruen AA, Levinger B (1973) Can J Math 25: 1060–1065.      

Blocking sets and semifields

We find a relationship between semifield spreads of PG(3,q), small Rédei minimal blocking sets of PG(2,q²), disjoint from a Baer subline of a Rédei line, and translation ovoids of the hermitian surface H(3,q²).     

Linear Point Sets and Rédei Type k-blocking Sets in PG(n, q)

In this paper, k-blocking sets in PG(n, q), being of Rédei type, are investigated. A standard method to construct Rédei type k-blocking sets in PG(n, q) is to construct a cone having as base a Rédei type k-blocking set in a subspace of PG(n, q). But also other Rédei type k-blocking sets in PG(n, q), which are not cones, exist. We give in this article a condition on the parameters of a Rédei type k-blocking set of PG(n, q = p ^h ), p a prime power, which guarantees that the Rédei type k-blocking set is a cone. This condition is sharp. We also show that small Rédei type k-blocking sets are linear.     

A Characterization of the Finite Veronesean by Intersection Properties

A combinatorial characterization of the Veronese variety of all quadrics in PG(n, q) by means of its intersection properties with respect to subspaces is obtained. The result relies on a similar combinatorial result on the Veronesean of all conics in the plane PG(2, q) by Ferri [Atti Accad. Naz. Lincei Rend. 61(6), 603?C610 (1976)], Hirschfeld and Thas [General Galois Geometries. Oxford University Press, New York (1991)], and Thas and Van Maldeghem [European J. Combin. 25(2), 275?C285 (2004)], and a structural characterization of the quadric Veronesean by Thas and Van Maldeghem [Q. J. Math. 55(1), 99?C113 (2004)].     

Cyclic Arcs in PG(2, q)

B.C. Kestenband [9], J.C. Fisher, J.W.P. Hirschfeld, and J.A. Thas [3], E. Boros, and T. Szönyi [1] constructed complete (q ² ? q + l)-arcs in PG(2, q ²), q ≥ 3. One of the interesting properties of these arcs is the fact that they are fixed by a cyclic protective group of order q ² ? q + 1. We investigate the following problem: What are the complete k-arcs in PG(2, q) which are fixed by a cyclic projective group of order k? This article shows that there are essentially three types of those arcs, one of which is the conic in PG(2, q), q odd. For the other two types, concrete examples are given which shows that these types also occur.     

Blocking Sets and Derivable Partial Spreads

We prove that a GF(q)-linear Rédei blocking set of size q ^t + q ^t–1 + ··· + q + 1 of PG(2,q ^t) defines a derivable partial spread of PG(2t – 1, q). Using such a relationship, we are able to prove that there are at least two inequivalent Rédei minimal blocking sets of size q ^t + q ^t–1 + ··· + q + 1 in PG(2,q ^t), if t 4.     

On the maximality of linear codes

We show that if a linear code admits an extension, then it necessarily admits a linear extension. There are many linear codes that are known to admit no linear extensions. Our result implies that these codes are in fact maximal. We are able to characterize maximal linear (n, k, d) _q -codes as complete (weighted) (n, n − d)-arcs in PG(k − 1, q). At the same time our results sharply limit the possibilities for constructing long non-linear codes. The central ideas to our approach are the Bruen-Silverman model of linear codes, and some well known results on the theory of directions determined by affine point-sets in PG(k, q).      

Tight sets and m-ovoids of finite polar spaces

An intriguing set of points of a generalised quadrangle was introduced in [J. Bamberg, M. Law, T. Penttila, Tight sets and m-ovoids of generalised quadrangles, Combinatorica, in press] as a unification of the pre-existing notions of tight set and m-ovoid. It was shown in [J. Bamberg, M. Law, T. Penttila, Tight sets and m-ovoids of generalised quadrangles, Combinatorica, in press] that every intriguing set of points in a finite generalised quadrangle is a tight set or an m-ovoid (for some m). Moreover, it was shown that an m-ovoid and an i-tight set of a common generalised quadrangle intersect in mi points. These results yielded new proofs of old results, and in this paper, we study the natural analogue of intriguing sets in finite polar spaces of higher rank. In particular, we use the techniques developed in this paper to give an alternative proof of a result of Thas [J.A. Thas, Ovoids and spreads of finite classical polar spaces, Geom. Dedicata 10 (1-4) (1981) 135-143] that there are no ovoids of H(2r,q²), Q⁻(2r+1,q), and W(2r−1,q) for r>2. We also strengthen a result of Drudge on the non-existence of tight sets in W(2r−1,q), H(2r+1,q²), and Q⁺(2r+1,q), and we give a new proof of a result of De Winter, Luyckx, and Thas [S. De Winter, J.A. Thas, SPG-reguli satisfying the polar property and a new semipartial geometry, Des. Codes Cryptogr. 32 (1-3) (2004) 153-166; D. Luyckx, m-Systems of finite classical polar spaces, PhD thesis, The University of Ghent, 2002] that an m-system of W(4m+3,q) or Q⁻(4m+3,q) is a pseudo-ovoid of the ambient projective space.     

Small weight codewords in the codes arising from Desarguesian projective planes

We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from PG(2, p), p prime. Chouinard characterized all the codewords up to weight 2p in these codes. Using a particular basis for this code, described by Moorhouse, we characterize all the codewords of weight up to 2p + (p−1)/2 if p ≥ 11. We then study the codes arising from . In particular, for q ₀ = p prime, p ≥ 7, we prove that the codes have no codewords with weight in the interval [q + 2, 2q − 1]. Finally, for the codes of PG(2, q), q = p ^h , p prime, h ≥ 4, we present a discrete spectrum for the weights of codewords with weights in the interval [q + 2, 2q − 1]. In particular, we exclude all weights in the interval [3q/2, 2q − 1]. Geertrui Van de Voorde research is supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen) Joost Winne was supported by the Fund for Scientific Research - Flanders (Belgium).     

Transversal-Free Translation Nets

Translation planes of order q ² containing non-Desarguesian Baer subplanes are used to construct transversal-free translation nets with very small deficiencies. Also, a generalization of the ideas of Bruen shows that any non-Desarguesian spread in PG(3, q) produces a transversal-free net of small deficiency.     

Regulus-free Spreads of PG(3,q)

An old conjecture of Bruck and Bose is that every spread of =PG(3,q) could be obtained by starting with a regular spread and reversing reguli. Although it was quickly realized that this conjecture is false, at least forq even, there still remains a gap in the spaces for which it is known that there are spreads which are regulus-free. In several papers Denniston, Bruen, and Bruen and Hirschfeld constructed spreads which were regulus-free, but none of these dealt with the case whenq is a prime congruent to one modulo three. This paper closes that gap by showing that for any odd prime powerq, spreads ofPG(3,q) yielding nondesarguesian flag-transitive planes are regulus-free. The arguments are interesting in that they are based on elementary linear algebra and the arithmetic of finite fields.Dedicated to Hanfried Lenz on the occasion of his 80th birthdayThis work was partially supported by NSA grant MDA 904-95-H-1013.This work was partially supported by NSA grant MDA 904-94-H-2033.     

The nonexistence of ternary [105,6,68] and [230,6,152] codes

Let [n,k,d]_q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, the nonexistence of [105,6,68]₃ and [230,6,152]₃ codes is proved.     

Small Blocking Sets in PG(2, p3)

In this paper we show that a small minimalblocking set in PG(2,p³), with p 7,is of Rédei type.     

The automorphism groups of Reed-Solomon codes

A class of maximum distance separable codes is introduced which includes Reed Solomon codes; extended Reed-Solomon codes, and other cyclic or pseudocyclie MDS codes studied recently. This class of codes, which we call “Cauchy codes” because of the special form of their generator matrices, forms a closed submanifold of dimension 2n - 4 in the k × (n - k)-dimensional algebraic manifold of all MDS codes of length n and dimension k. For every Cauchy code we determine the automorphism group and its underlying permutation group. Far doubly-extended Reed-Solomon codes over GF(q) the permutation group is the semilinear fractional group PΛL(2, q).     

On affine designs and Hadamard designs with line spreads

Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291-303] described a construction that relates any Hadamard design H on 4^m-1 points with a line spread to an affine design having the same parameters as the classical design of points and hyperplanes in AG(m,4). Here it is proved that the affine design is the classical design of points and hyperplanes in AG(m,4) if, and only if, H is the classical design of points and hyperplanes in PG(2m-1,2) and the line spread is of a special type. Computational results about line spreads in PG(5,2) are given. One of the affine designs obtained has the same 2-rank as the design of points and planes in AG(3,4), and provides a counter-example to a conjecture of Hamada [On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error-correcting codes, Hiroshima Math. J. 3 (1973) 153-226].     

On the intersection of two subgeometries of PG(n, q)

The study of the intersection of two Baer subgeometries of PG(n, q), q a square, started in Bose et al. (Utilitas Math 17, 65–77, 1980); Bruen (Arch Math 39(3), 285–288, (1982). Later, in Svéd (Baer subspaces in the n-dimensional projective space. Springer-Verlag) and Jagos et al. (Acta Sci Math 69(1–2), 419–429, 2003), the structure of the intersection of two Baer subgeometries of PG(n, q) has been completely determined. In this paper, generalizing the previous results, we determine all possible intersection configurations of any two subgeometries of PG(n, q).      

A remark on symplectic spreads

We first note that each element of a symplectic spread of PG(2n − 1, 2 ^r ) either intersects a suitable nonsingular quadric in a subspace of dimension n − 2 or is contained in it, then we prove that this property characterises symplectic spreads of PG(2n − 1, 2 ^r ). As an application, we show that a translation plane of order q ⁿ , q even, with kernel containing GF(q), is defined by a symplectic spread if and only if it contains a maximal arc of the type constructed by Thas (Europ J Combin 1:189–192, 1980).     

Complete Spans on Hermitian Varieties

Let L be a general linear complex in PG(3, q) for any prime power q. We show that when GF(q) is extended to GF(q ²), the extended lines of L cover a non-singular Hermitian surface H ? H(3, q ²) of PG(3, q ²). We prove that if Sis any symplectic spread PG(3, q), then the extended lines of this spread form a complete (q ² + 1)-span of H. Several other examples of complete spans of H for small values of q are also discussed. Finally, we discuss extensions to higher dimensions, showing in particular that a similar construction produces complete (q ³ + 1)-spans of the Hermitian variety H(5, q ²).     

Transitive Arcs in Planes of Even Order

When one considers the hyperovals inPG(2,q),qeven,q>2, then the hyperoval inPG(2, 4) and the Lunelli-Sce hyperoval inPG(2, 16) are the only hyperovals stabilized by a transitive projective group [10]. In both cases, this group is an irreducible group fixing no triangle in the plane of the hyperoval, nor in a cubic extension of that plane. Using Hartley's classification of subgroups ofPGL₃(q),qeven [6], allk-arcs inPG(2,q) fixed by a transitive irreducible group, fixing no triangle inPG(2,q) or inPG(2,q³), are determined. This leads to new 18-, 36- and 72-arcs inPG(2,q),q=2^2h. The projective equivalences among the arcs are investigated and each section ends with a detailed study of the collineation groups of these arcs.