We improve on the lower bound of the maximum number of planes in PG(8,q)≅\Fq9 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+2q4−2q2−2q+1. This result is obtained via a more general construction strategy, which also yields other improvements.
@article{arxiv.1907.02728,
title = {Subspaces intersecting in at most a point},
author = {Sascha Kurz},
journal= {arXiv preprint arXiv:1907.02728},
year = {2019}
}