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

Original language | English |
---|---|

Journal | Designs, Codes and Cryptography |

Volume | 31 |

Issue number | 1 |

Pages (from-to) | 15-26 |

ISSN | 0925-1022 |

Publication status | Published - 2004 |

## Cite this

Barat, J. (2004). Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8).

*Designs, Codes and Cryptography*,*31*(1), 15-26.