Small Strong Blocking Sets by Concatenation
Daniele Bartoli, Martino Borello · SIAM Journal on Discrete Mathematics · 2023
Abstract. Strong blocking sets and their counterparts, minimal codes, have attracted much attention in the past few years. Combining the concatenating construction of codes with a geometric insight into the minimality condition, we explicitly provide infinite families of small strong blocking sets, whose size is linear in the dimension of the ambient projective spaces. As a byproduct, small saturating sets are obtained.