๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimal Blocking Sets in Projective Spaces of Square Order

โœ Scribed by Martin Bokler

Book ID
110298817
Publisher
Springer
Year
2001
Tongue
English
Weight
125 KB
Volume
24
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Proper blocking sets in projective space
Proper blocking sets in projective spaces
โœ Udo Heim ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 477 KB

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

Blocking sets in finite projective space
Blocking sets in finite projective spaces and uneven binary codes
โœ W.Edwin Clark ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 373 KB

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

Embedding the complement of a minimal bl
Embedding the complement of a minimal blocking set in a projective plane
โœ Lynn Margaret Batten ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 373 KB

A blocking set B in a projective plane z of order n is a subset of T which meets every line but contains no line completely. Hence le)B n I] srz for every line i of 9r.I A blocking set is minimal if it contains no proper blocking set. A blocking set is maximal if it is not properly contained in any