2000 character limit reached
Subspaces intersecting in at most a point (1907.02728v1)
Published 5 Jul 2019 in math.CO, cs.IT, and math.IT
Abstract: We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q{9}$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)\ge q{12}+ 2q8+2q7+q6+2q5+2q4-2q2-2q+1$. This result is obtained via a more general construction strategy, which also yields other improvements.