A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets …
T Héger, ZL Nagy - IEEE Transactions on Information Theory, 2021 - ieeexplore.ieee.org
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets …
Let PG(r, q) be the r-dimensional projective space over the finite field GF(q). A set 𝒳 of points of PG(r, q) is a cutting blocking set if for each hyperplane Π of PG(r, q) the set Π∩ …
L Denaux - arXiv preprint arXiv:2109.08572, 2021 - arxiv.org
This work focuses on higgledy-piggledy sets of $ k $-subspaces in $\text {PG}(N, q) $, ie sets of projective subspaces that are'well-spread-out'. More precisely, the set of intersection …
SL Fancsali, P Sziklai - the electronic journal of combinatorics, 2014 - combinatorics.org
In this article, we examine sets of lines in $\mathsf {PG}(d,\mathbb {F}) $ meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least …
Resolving sets for higher dimensional projective spaces - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
In this article, we investigate collections of 'well-spread-out'projective (and linear) subspaces. Projective k-subspaces in PG (d, F) PG (d, F) are in 'higgledy-piggledy …
V Smaldore - Examples and Counterexamples, 2023 - Elsevier
Minimal codes are being intensively studied in last years.[n, k] q-minimal linear codes are in bijection with strong blocking sets of size n in PG (k− 1, q) and a lower bound for the size of …
Characterising and constructing codes using finite geometries Page 1 Characterising and constructing codes using finite geometries Dissertation submitted in partial fulfilment of the …