Outer strong blocking sets - HAL UNIV-PARIS8 - open access Accéder directement au contenu
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2024

Outer strong blocking sets

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

  • HAL Id : hal-04508476 , version 1

Citer

Gianira Alfarano, Martino Borello, Alessandro Neri. Outer strong blocking sets. The Electronic Journal of Combinatorics, inPress. ⟨hal-04508476⟩
9 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More