Outer Strong Blocking Sets

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Alfarano, Gianira N., Borello, Martino, Neri, Alessandro
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929276771631104
author Alfarano, Gianira N.
Borello, Martino
Neri, Alessandro
author_facet Alfarano, Gianira N.
Borello, Martino
Neri, Alessandro
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2301_09590
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Outer Strong Blocking Sets
Alfarano, Gianira N.
Borello, Martino
Neri, Alessandro
Combinatorics
Information Theory
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.
title Outer Strong Blocking Sets
topic Combinatorics
Information Theory
url https://arxiv.org/abs/2301.09590