Upper bounds for partial spreads

Titelangaben

Heinlein, Daniel ; Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
Upper bounds for partial spreads.
2017
Veranstaltung: Computeralgebra-Tagung 2017 , 04.-06.05.2017 , Kassel, Deutschland.
(Veranstaltungsbeitrag: Kongress/Konferenz/Symposium/Tagung , Vortrag )

Weitere URLs

Angaben zu Projekten

Abstract

A partial t-spread in GF(q)^n is a collection of t-dimensional subspaces with trivial intersection such that
each non-zero vector is covered at most once. How many t-dimensional subspaces can be packed into GF(q)^n , i.e., what is the maximum cardinality of a partial t-spread? An upper bound, given by Drake and Freeman, survived almost forty years without any improvement. At the end of 2015, the upper bounds started to crumble. Here, the theoretical foundation is provided by the fact that the uncovered points, called holes in this context, form a projective q^{t-1}-divisible linear block code. This allows to apply
the linear programming method, i.e., to utilize the so-called MacWilliams identities and the positivity of the coefficients of the weight enumerator of the corresponding dual code. In this talk we will exhibit how this well known approach from coding theory can used to obtain analytical bounds on the maximum size of partial $t$-spreads that form the present state-of-the-art.