Constructing minimal blocking sets using field reduction
Geertrui Van de Voorde

TL;DR
This paper introduces a new method for constructing minimal blocking sets in projective spaces over finite fields using field reduction and blocking cones, extending known constructions and relating to the linearity conjecture.
Contribution
It presents a novel construction for minimal blocking sets via field reduction and blocking cones, generalizing the MPS-construction and characterizing linearity of small minimal blocking sets.
Findings
The new construction yields larger blocking sets than previous planar-based methods.
Every minimal blocking set with respect to hyperplanes can be obtained through field reduction from smaller spaces.
Small minimal blocking sets from the cone construction are linear, linking to the linearity conjecture.
Abstract
We present a construction for minimal blocking sets with respect to -spaces in , the -dimensional projective space over the finite field of order . The construction relies on the use of blocking cones in the {\em field reduced} representation of , extending the well-known construction of linear blocking sets. This construction is inspired by the construction for minimal blocking sets with respect to the hyperplanes by Mazzocca, Polverino and Storme ({\em the MPS-construction}); we show that for a suitable choice of the blocking cone over a planar blocking set, we obtain larger blocking sets than the ones obtained from planar blocking sets in \cite{pol}. Furthermore we show that every minimal blocking set with respect to the hyperplanes in can be obtained by applying field…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
