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.
|Journal||Designs, Codes and Cryptography|