Strong blocking sets, introduced first in 2011 in connection with saturating sets, have recently gained a lot of attention due to their correspondence with minimal codes. In this paper, we dig into the geometry of the concatenation method, introducing the concept of outer strong blocking sets and their coding theoretical counterpart. We investigate their structure and provide bounds on their size. As a byproduct, we improve the best-known upper bound on the minimum size of a strong blocking set. Finally, we present a geometric construction of small strong blocking sets, whose computational cost is significantly smaller than the previously known ones.
@article{10_37236_12046,
author = {Gianira N. Alfarano and Martino Borello and Alessandro Neri},
title = {Outer strong blocking sets},
journal = {The electronic journal of combinatorics},
year = {2024},
volume = {31},
number = {2},
doi = {10.37236/12046},
zbl = {1544.94285},
url = {http://geodesic.mathdoc.fr/articles/10.37236/12046/}
}
TY - JOUR
AU - Gianira N. Alfarano
AU - Martino Borello
AU - Alessandro Neri
TI - Outer strong blocking sets
JO - The electronic journal of combinatorics
PY - 2024
VL - 31
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/12046/
DO - 10.37236/12046
ID - 10_37236_12046
ER -
