Schubert subspace codes are constant-dimension subspace codes such that all codewords are contained in a given Schubert variety, which is a subvariety of the Grassmannian.

We focus on the case where each codeword is a subspace that intersects a fixed subspace U in dimension at least 1. We fix the maximum value for the minumum subspace distance of the Schubert subspace code and try to optimize its size. We provide a geometric construction which achieves this maximum size using linear sets.

Finally, we generalize the problem to different values of the minimum distance.

This is joint work with Gianira Alfarano and Joachim Rosenthal.