On 1-Blocking Sets in PG(n,q), n≥ 3

Autor: Storme, L., Weiner, Zs.
Zdroj: Designs, Codes and Cryptography; October 2000, Vol. 21 Issue: 1-3 p235-251, 17p
Abstrakt: In this article we study minimal1-blocking sets in finite projective spaces PG(n,q),n≥ 3. We prove that in PG(n,q2),q= ph, pprime, p> 3,h≥ 1, the second smallest minimal 1-blockingsets are the second smallest minimal blocking sets, w.r.t.lines, in a plane of PG(n,q2). We also study minimal1-blocking sets in PG(n,q3), n≥ 3, q= ph, pprime, p> 3,q≠ 5, and prove that the minimal 1-blockingsets of cardinality at most q3+ q2+ q+ 1are eithera minimal blocking set in a plane or a subgeometry PG(3,q).
Databáze: Supplemental Index