A new construction of cyclic subspace codes

Abstract

Subspace codes have attracted a lot of attention in the last few decades due to their applications in noncoherent linear network coding, in particular cyclic subspace codes can be encoded and decoded more efficiently because of their special algebraic structure. In this paper, we present a family of cyclic subspace codes with minimum distance \(\varvec{2k-2}\) and size \(\varvec{seq^{k}(q^k-1)^{s-1}(q^n-1)+\frac{q^n-1}{q^k-1}}\), where \(\varvec{k|n}\), \(\varvec{\frac{n}{k}\ge 2s+1}\), \(\varvec{s\ge 1, e=\lceil \frac{n}{2sk} \rceil -1}\). In the case of \(\varvec{n=(2s+1)k}\) with \(\varvec{2\le s <q^k}\), our cyclic subspace codes have larger size than the known ones in the literature.