English

Subspaces intersecting in at most a point

Combinatorics 2019-12-02 v1 Information Theory math.IT

Abstract

We improve on the lower bound of the maximum number of planes in PG(8,q)\Fq9\operatorname{PG}(8,q)\cong\F_q^{9} pairwise intersecting in at most a point. In terms of constant dimension codes this leads to Aq(9,4;3)q12+2q8+2q7+q6+2q5+2q42q22q+1A_q(9,4;3)\ge q^{12}+ 2q^8+2q^7+q^6+2q^5+2q^4-2q^2-2q+1. This result is obtained via a more general construction strategy, which also yields other improvements.

Keywords

Cite

@article{arxiv.1907.02728,
  title  = {Subspaces intersecting in at most a point},
  author = {Sascha Kurz},
  journal= {arXiv preprint arXiv:1907.02728},
  year   = {2019}
}

Comments

4 pages

R2 v1 2026-06-23T10:12:58.570Z