Characterization results on weighted minihypers and on linear codes meeting the G(r)iesmer bound

A

The use of blocking sets in Galois geometries and in related research areas

Blocking sets play a central role in Galois geometries. Besides their intrinsic geometrical importance, the importance of blocking sets also arises from the use of blocking sets for the solution of many other geometrical problems, and problems in related research areas. This article focusses on these applications to motivate researchers to investigate blocking sets, and to motivate researchers to investigate the problems that can be solved by using blocking sets. By showing the many applications on blocking sets, we also wish to prove that researchers who improve results on blocking sets in fact open the door to improvements on the solution of many other problems

A study of (xvt,xvt−1)-minihypers in PG(t,q)

AbstractWe study (xvt,xvt−1)-minihypers in PG(t,q), i.e. minihypers with the same parameters as a weighted sum of x hyperplanes. We characterize these minihypers as a nonnegative rational sum of hyperplanes and we use this characterization to extend and improve the main results of several papers which have appeared on the special case t=2. We establish a new link with coding theory and we use this link to construct several new infinite classes of (xvt,xvt−1)-minihypers in PG(t,q) that cannot be written as an integer sum of hyperplanes

A study of (x(q+1),x;2,q)-minihypers

In this paper, we study the weighted (x(q + 1), x; 2, q)-minihypers. These are weighted sets of x(q + 1) points in PG(2, q) intersecting every line in at least x points. We investigate the decomposability of these minihypers, and define a switching construction which associates to an (x(q + 1), x; 2, q)-minihyper, with x <= q(2) - q, not decomposable in the sum of another minihyper and a line, a (j (q + 1), j; 2, q)-minihyper, where j = q(2) - q-x, again not decomposable into the sum of another minihyper and a line. We also characterize particular (x(q + 1), x; 2, q)-minihypers, and give new examples. Additionally, we show that (x(q + 1), x; 2, q)-minihypers can be described as rational sums of lines. In this way, this work continues the research on (x(q + 1), x; 2, q)-minihypers by Hill and Ward (Des Codes Cryptogr 44: 169-196, 2007), giving further results on these minihypers

Linear codes meeting the Griesmer bound, minihypers and geometric applications

Coding theory and Galois geometries are two research areas which greatly influence each other. In this talk, we focus on the link between linear codes meeting the Griesmer bound and minihypers in finite projective spaces. Minihypers are particular (multiple) blocking sets. We present characterization results on minihypers, leading to equivalent characterization results on linear codes meeting the Griesmer bound. Next to being interesting from a coding-theoretical point of view, minihypers also are interesting for geometrical applications. We present results on maximal partial μ-spreads in PG(N, q), (μ + 1)|(N + 1), on minimal μ-covers in PG(N, q), (μ + 1)|(N + 1), on (N − 1)-covers of Q + (2N + 1, q), on partial ovoids and on partial spreads of finite classical polar spaces, and on partial ovoids of generalized hexagons, following from results on minihypers

A characterisation result on a particular class of non-weighted minihypers

We present a characterisation of {epsilon(1)(q + 1)+ epsilon(0), epsilon(1); n, q}-minihypers, q square, q = p(h), p > 3 prime, h >= 2, q >= 1217, for epsilon(0) + epsilon(1) < q(7/12)/2 - q(1/4)/2. This improves a characterisation result of Ferret and Storme (Des Codes Cryptogr 25(2): 143- 162, 2002), involving more Baer subgeometries contained in the minihyper

Tight sets in finite classical polar spaces

We show that every i-tight set in the Hermitian variety H(2r + 1, q) is a union of pairwise disjoint (2r + 1)-dimensional Baer subgeometries PG(2r + 1, root q) and generators of H(2r + 1, q), if q >= 81 is an odd square and i < (q(2/3) - 1)/2. We also show that an i-tight set in the symplectic polar space W(2r + 1, q) is a union of pairwise disjoint generators of W(2r + 1, q), pairs of disjoint r-spaces {Delta,Delta(perpendicular to)}, and (2r + 1)-dimensional Baer subgeometries. For W(2r + 1, q) with r even, pairs of disjoint r-spaces {Delta,Delta(perpendicular to)} cannot occur. The (2r + 1)-dimensional Baer subgeometries in the i-tight set of W(2r + 1, q) are invariant under the symplectic polarity perpendicular to of W(2r + 1, q) or they arise in pairs of disjoint Baer subgeometries corresponding to each other under perpendicular to. This improves previous results where i < q(5/8)/root 2+ 1 was assumed. Generalizing known techniques and using recent results on blocking sets and minihypers, we present an alternative proof of this result and consequently improve the upper bound on i to (q(2/3) - 1)/2. We also apply our results on tight sets to improve a known result on maximal partial spreads in W(2r + 1, q)