On primitive constant dimension codes and a geometrical sunflower bound
Roland D. Barrolleta, Emilio Suárez-Canedo, Leo Storme, Peter Vandendriessche · Advances in Mathematics of Communications · 2017
In this paper we study subspace codes with constant intersection dimension (SCIDs). We investigate the largest possible dimension spanned by such a code that can yield non-sunflower codes, and classify the examples attaining equality in that bound as one of two infinite families. We also construct a new infinite family of primitive SCIDs.