Small Strong Blocking Sets by Concatenation

Daniele Bartoli (1) , Martino Borello (2)

1 DMI - Dipartimento di Matematica e Informatica [Perugia]
2 LAGA - Laboratoire Analyse, Géométrie et Applications

Strong blocking sets and their counterparts, minimal codes, attracted lots of attention in the last 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.

Domaines: Mathématiques [math]

Daniele Bartoli, Martino Borello. Small Strong Blocking Sets by Concatenation. 2022. ⟨hal-03857727⟩