We classify the smallest two fold blocking sets with respect to the (n-k)-spaces in PG(n, 2). We show that they either consist of two disjoint k-dimensional subspaces or are equal to a (k + 1)-dimensional space minus one point
The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sha...
Abstract Let and ¯B be a subset of = PG(2n − 1, q) and a subset of PG(2n, q) respectively, with ...
This article continues the study of multiple blocking sets in PG(2, q). In [A. Blokhuis, L. Storme, ...
We classify the smallest two fold blocking sets with respect to the (n-k)-spaces in PG(n, 2). We sho...
We classify the smallest two fold blocking sets with respect to the (n-k)-spaces in PG(n, 2).We show...
AbstractWe determine the smallest nontrivial blocking sets with respect to t-spaces in PG(n,2), n⩾3....
In [10], it was shown that small t-fold (n - k)-blocking sets in PG(n, q), q = p(h), p prime, h >= 1...
AbstractWe show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyp...
AbstractWe prove that a small minimal blocking set of PG(2,q) is “very close” to be a linear blockin...
AbstractIn this paper we characterize the GF(q)-linear blocking sets in PG(2,qt) of maximal size and...
The main purpose of this paper is to find double blocking sets in PG(2,q) of size less than 3q, in p...
A small minimal k-blocking set B in PG(n,q), q = p(t), p prime, is a set of less than 3(q(k)+1)/2 po...
In this paper, we characterise the smallest sets B consisting of points and hyperplanes in PG(n, q),...
AbstractA (q+1)-fold blocking set of size (q+1)(q4+q2+1) in PG(2, q4) which is not the union of q+1 ...
Let Ω and B̄ be a subset of ∑ = PG(2n-1,q) and a subset of PG(2n,q) respectively, with ∑ ⊂ PG(2n,q) ...
The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sha...
Abstract Let and ¯B be a subset of = PG(2n − 1, q) and a subset of PG(2n, q) respectively, with ...
This article continues the study of multiple blocking sets in PG(2, q). In [A. Blokhuis, L. Storme, ...
We classify the smallest two fold blocking sets with respect to the (n-k)-spaces in PG(n, 2). We sho...
We classify the smallest two fold blocking sets with respect to the (n-k)-spaces in PG(n, 2).We show...
AbstractWe determine the smallest nontrivial blocking sets with respect to t-spaces in PG(n,2), n⩾3....
In [10], it was shown that small t-fold (n - k)-blocking sets in PG(n, q), q = p(h), p prime, h >= 1...
AbstractWe show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyp...
AbstractWe prove that a small minimal blocking set of PG(2,q) is “very close” to be a linear blockin...
AbstractIn this paper we characterize the GF(q)-linear blocking sets in PG(2,qt) of maximal size and...
The main purpose of this paper is to find double blocking sets in PG(2,q) of size less than 3q, in p...
A small minimal k-blocking set B in PG(n,q), q = p(t), p prime, is a set of less than 3(q(k)+1)/2 po...
In this paper, we characterise the smallest sets B consisting of points and hyperplanes in PG(n, q),...
AbstractA (q+1)-fold blocking set of size (q+1)(q4+q2+1) in PG(2, q4) which is not the union of q+1 ...
Let Ω and B̄ be a subset of ∑ = PG(2n-1,q) and a subset of PG(2n,q) respectively, with ∑ ⊂ PG(2n,q) ...
The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sha...
Abstract Let and ¯B be a subset of = PG(2n − 1, q) and a subset of PG(2n, q) respectively, with ...
This article continues the study of multiple blocking sets in PG(2, q). In [A. Blokhuis, L. Storme, ...
DOI
Add to ORKG