摘要

Subspace codes and particularly cyclic subspace codes have attracted a lot of research due to their applications in error correction for random network coding. In this paper, we explore the parameters of a class of the cyclic subspace codes whose subspace polynomials are more generalized. Therefore, some corollaries that extend the previously known results are obtained. Finally, a construction of k-dimensional cyclic subspace codes of size q(N)-1/q-1 and minimal distance 2k - 2 is provided.