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

Janos Barat

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

Janos Barat

Research output: Contribution to journal › Journal article › Research › peer-review

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

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{1a03dc1749f84720b7ae82b183a86bc9,

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

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.",

author = "Janos Barat",

year = "2004",

language = "English",

volume = "31",

pages = "15--26",

journal = "Designs, Codes and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

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

AU - Barat, Janos

PY - 2004

Y1 - 2004

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

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

M3 - Journal article

SN - 0925-1022

VL - 31

SP - 15

EP - 26

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

IS - 1

ER -

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

Abstract

OpenUrl availability

Fingerprint

Cite this