Outer strong blocking sets - Archive ouverte HAL Access content directly
Journal Articles The Electronic Journal of Combinatorics Year : 2024

Outer strong blocking sets

Abstract

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.
Fichier principal
Vignette du fichier
2301.09590.pdf (295.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04508476 , version 1 (18-03-2024)

Identifiers

  • HAL Id : hal-04508476 , version 1

Cite

Gianira Alfarano, Martino Borello, Alessandro Neri. Outer strong blocking sets. The Electronic Journal of Combinatorics, inPress. ⟨hal-04508476⟩
1 View
0 Download

Share

Gmail Facebook X LinkedIn More