Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8)
Publication: Research - peer-review › Journal article – Annual report year: 2004
We prove that PG(2, 8) does not contain minimal blocking sets of size 14. Using this result we prove that 58 is the largest size for a maximal partial spread of PG(3, 8). This supports the conjecture that q2-q+ 2 is the largest size for a maximal partial spread of PG(3, q), q>7.
| Original language | English |
|---|---|
| Journal | Designs, Codes and Cryptography |
| Publication date | 2004 |
| Volume | 31 |
| Journal number | 1 |
| Pages | 15-26 |
| ISSN | 0925-1022 |
| State | Published |
ID: 2671157