On MPS construction of blocking sets in projective spaces: a generalization (Q898162)

In a projective or affine space of dimension \(n\), a \(k\)-blocking set is a set of points meeting every \((n-k)\)-dimensional subspace. A \(1\)-blocking set is simply a blocking set. A \(k\)-blocking set is trivial if it contains a \(k\)-dimensional subspace at minimal if it does not contain a smaller \(k\)-blocking set. \textit{F. Mazzocca} et al. provided constructions of blocking sets in projective spaces starting from the Barlotti-Cofman representation of \(\mathrm{PG}(r,q^n)\) in \(\mathrm{PG}(nr,q)\); see [Des. Codes Cryptography 44, No. 1--3, 97--113 (2007; Zbl 1122.51010)]. In this paper, the author gives a generalization of one of these constructions in \(\mathrm{PG}(r,q^n)\) (denoted as MPS construction) using subspaces of dimension \(s\leq n-2\). In particular, an example of minimal blocking set in \(\mathrm{PG}(3,q^6)\) not equivalent to an MPS one is obtained.