© 2017 AIMS. 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-sunower 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.
|Journal||Advances in Mathematics of Communications|
|Publication status||Published - 1 Nov 2017|
- Constant intersection dimension codes
- Finite geometry
- Galois geometry
- Rank codes
- Subspace codes