## Abstract The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sharp when __q__ is a square. Here the bound is improved if __q__ is a non‐square. On the other hand, we present some constructions of reasonably large minimal blocking sets in planes of non‐p
✦ LIBER ✦
On the spectrum of minimal blocking sets in PG$(2,q)$
✍ Scribed by Tamás Szőnyi,András Gács,Zsuzsa Weiner
- Book ID
- 113014301
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 222 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0047-2468
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On large minimal blocking sets in PG(2,q
✍
Tamás Szőnyi; Antonello Cossidente; András Gács; Csaba Mengyán; Alessandro Sicil
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 172 KB
👁 1 views
On the cardinality of blocking sets in P
✍
Luigia Berardi; Franco Eugeni
📂
Article
📅
1984
🏛
Springer
🌐
English
⚖ 391 KB
Largest minimal blocking sets in PG(2,8)
✍
J. Barát; S. Innamorati
📂
Article
📅
2003
🏛
John Wiley and Sons
🌐
English
⚖ 120 KB
👁 1 views
## Abstract Bruen and Thas proved that the size of a large minimal blocking set is bounded by $q \cdot {\sqrt{q}} + 1$. Hence, if __q__ = 8, then the maximal possible size is 23. Since 8 is not a square, it was conjectured that a minimal blocking 23‐set does not exist in PG(2,8). We show that this
The spectrum of minimal blocking sets
✍
Stefano Innamorati; Antonio Maturo
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 87 KB
Linear (q+1)-fold Blocking Sets in PG(2,
✍
Simeon Ball; Aart Blokhuis; Michel Lavrauw
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 109 KB
Minimal Blocking Sets in PG(2,8) and Max
✍
J. Barát; A. Del Fra; S. Innamorati; L. Storme
📂
Article
📅
2004
🏛
Springer
🌐
English
⚖ 185 KB