Subspace code constructions

05/27/2019

∙

by   Antonio Cossidente, et al.

∙

0

∙

share

We improve on the lower bound of the maximum number of planes of PG(8,q) mutually intersecting in at most one point leading to the following lower bound: A_q(9, 4; 3) > q^12+2q^8+2q^7+q^6+q^5+q^4+1 for constant dimension subspace codes. We also construct two new non-equivalent (6, (q^3-1)(q^2+q+1), 4; 3)_q constant dimension subspace orbit-codes.