Explicit construction of strong s-blocking sets of size O_s(q^s k) in PG(k-1,q) via hypergraphs on expander graphs, yielding optimal affine blocking sets and s-minimal codes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Explicit constructions of optimal blocking sets and minimal codes
Explicit construction of strong s-blocking sets of size O_s(q^s k) in PG(k-1,q) via hypergraphs on expander graphs, yielding optimal affine blocking sets and s-minimal codes.