A dual blocking set is a set of points which meets every blocking set but contains no line. We establish a lower bound for the cardinality of such a set, and characterize sets meeting the bound, in projective and affine planes. A blocking set for a family ~-of sets is a set which meets every member
Blocking-sets in infinite projective and affine spaces
β Scribed by Albrecht Beutelspacher; Francesco Mazzocca
- Book ID
- 112498825
- Publisher
- Springer
- Year
- 1987
- Tongue
- English
- Weight
- 247 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0047-2468
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we show that blocking sets of cardinality less than 3(q Ο© 1)/2 (q Ο p n ) in Desarguesian projective planes intersect every line in 1 modulo p points. It is also shown that the cardinality of a blocking set must lie in a few relatively short intervals. This is similar to previous resul
In this paper we introduce the new concept of proper blocking sets B infinite projective spaces, that means every hyperplane contains a point of B, no line is contained in B, and there is no hyperplane that induces a blocking set. In Theorem 1.4, we prove that a blocking set in PG(d, q), q ~> 3, tha
Clark, W.E., Blocking sets in finite projective spaces and uneven binary codes, Discrete Mathematics 94 (1991) 65-68. A l-blocking set in the projective space PG(m, 2), m >2, is a set B of points such that any (m -I)-flat meets B and no l-flat is contained in B. A binary linear code is said to be un