Journal article
Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8)
In
Designs, Codes and Cryptography
—
2004, Volume 31, Issue 1, pp. 15-26
Abstract
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.
| Language: | English |
|---|---|
| Year: | 2004 |
| Pages: | 15-26 |
| ISSN: | 15737586 and 09251022 |
| Types: | Journal article |
