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
## 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