𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal Blocking Sets in PG(2,8) and Maximal Partial Spreads in PG(3,8)

✍ Scribed by J. Barát; A. Del Fra; S. Innamorati; L. Storme

Book ID
111569122
Publisher
Springer
Year
2004
Tongue
English
Weight
185 KB
Volume
31
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Largest minimal blocking sets in PG(2,8)
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

On large minimal blocking sets in PG(2,q
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