Small Strong Blocking Sets by Concatenation
Combinatorics
2023-01-24 v2 Information Theory
math.IT
Abstract
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.
Cite
@article{arxiv.2109.00584,
title = {Small Strong Blocking Sets by Concatenation},
author = {Daniele Bartoli and Martino Borello},
journal= {arXiv preprint arXiv:2109.00584},
year = {2023}
}
Comments
16 pages