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

Publication: Research - peer-reviewJournal article – Annual report year: 2004

View graph of relations

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 languageEnglish
JournalDesigns, Codes and Cryptography
Volume31
Issue number1
Pages (from-to)15-26
ISSN0925-1022
StatePublished - 2004
Peer-reviewedYes
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

ID: 2671157