19 research outputs found

    Linear codes meeting the Griesmer bound, minihypers and geometric applications

    Get PDF
    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

    Partial ovoids and partial spreads in symplectic and orthogonal polar spaces

    Get PDF
    We present improved lower bounds on the sizes of small maximal partial ovoids and small maximal partial spreads in the classical symplectic and orthogonal polar spaces, and improved upper bounds on the sizes of large maximal partial ovoids and large maximal partial spreads in the classical symplectic and orthogonal polar spaces. An overview of the status regarding these results is given in tables. The similar results for the hermitian classical polar spaces are presented in [J. De Beule, A. Klein, K. Metsch, L. Storme, Partial ovoids and partial spreads in hermitian polar spaces, Des. Codes Cryptogr. (in press)]

    Partial ovoids and partial spreads in finite classical polar spaces

    Get PDF
    We survey the main results on ovoids and spreads, large maximal partial ovoids and large maximal partial spreads, and on small maximal partial ovoids and small maximal partial spreads in classical finite polar spaces. We also discuss the main results on the spectrum problem on maximal partial ovoids and maximal partial spreads in classical finite polar spaces

    Tight sets in finite classical polar spaces

    Get PDF
    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)

    Intertwined results on linear codes and Galois geometries

    Get PDF

    Partial Ovoids and Partial Spreads of Classical Finite Polar Spaces

    Get PDF
    2000 Mathematics Subject Classification: 05B25, 51E20.We survey the main results on ovoids and spreads, large maximal partial ovoids and large maximal partial spreads, and on small maximal partial ovoids and small maximal partial spreads in classical finite polar spaces. We also discuss the main results on the spectrum problem on maximal partial ovoids and maximal partial spreads in classical finite polar spaces.The research of the fourth author was also supported by the Project Combined algorithmic and the oretical study of combinatorial structur es between the Fund for Scientific Research Flanders-Belgium (FWO-Flanders) and the Bulgarian Academy of Science

    Divisible Codes

    Get PDF
    corecore