A Note on Strong Blocking Sets and Higgledy-Piggledy Sets of Lines
Open Access
- 4 July 2025
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (3) , P3.27
Abstract
This paper studies strong blocking sets in the $N$-dimensional finite projective space $\mathrm{PG}(N,q)$. We first show that certain unions of blocking sets cannot form strong blocking sets, which leads to a new lower bound on the size of a strong blocking set in $\mathrm{PG}(N,q)$. Our second main result shows that, for $q>\frac{2}{\ln(2)}(N+1)$, there exists a subset of $2N-2$ lines of a Desarguesian line spread in $\mathrm{PG}(N,q)$, $N$ odd, in higgledy-piggledy arrangement; thus giving rise to a strong blocking set of size $(2N-2)(q+1)$.
Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Strong blocking sets and minimal codes from expander graphsTransactions of the American Mathematical Society, 2024
- Blocking sets, minimal codes and trifferent codesJournal of the London Mathematical Society, 2024
- On the lower bound for the length of minimal codesDiscrete Mathematics, 2023
- Small Strong Blocking Sets by ConcatenationSIAM Journal on Discrete Mathematics, 2023
- Three Combinatorial Perspectives on Minimal CodesSIAM Journal on Discrete Mathematics, 2022
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective SpacesIEEE Transactions on Information Theory, 2021
- Full Characterization of Minimal Linear Codes as Cutting Blocking SetsIEEE Transactions on Information Theory, 2021
- Minimal linear codes arising from blocking setsJournal of Algebraic Combinatorics, 2020
- Multiple Blocking Sets in PG(n, q), n > 3Designs, Codes and Cryptography, 2004
- Blocking sets and partial spreads in finite projective spacesGeometriae Dedicata, 1980