Linear point sets and Rédei type \(k\)-blocking sets in \(\mathrm{PG}(n,q)\)
From MaRDI portal
Publication:1610688
DOI10.1023/A:1012724219499zbMath0999.05015MaRDI QIDQ1610688
Publication date: 20 August 2002
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Related Items (18)
The Use of Blocking Sets in Galois Geometries and in Related Research Areas ⋮ Functions over finite fields that determine few directions ⋮ Small point sets of \(\text{PG}(n,p^{3h})\) intersecting each line in 1 mod \(p^{h}\) points ⋮ Projective planes of Lenz-Barlotti class V. ⋮ On the number of directions determined by a pair of functions over a prime field ⋮ Unique reducibility of multiple blocking sets ⋮ An extension of the direction problem ⋮ A small minimal blocking set in \(\mathrm{PG}(n,p^t)\), spanning a \((t-1)\)-space, is linear ⋮ On small blocking sets and their linearity ⋮ On the directions problem in \(AG(n,q)\) ⋮ Small blocking sets in higher dimensions ⋮ On the graph of a function in two variables over a finite field ⋮ Linear sets in finite projective spaces ⋮ Constructing Minimal Blocking Sets Using Field Reduction ⋮ On the graph of a function in many variables over a finite field ⋮ Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group ⋮ Some generalizations of Rédei’s theorem ⋮ On the maximality of linear codes
Cites Work
This page was built for publication: Linear point sets and Rédei type \(k\)-blocking sets in \(\mathrm{PG}(n,q)\)