Subspace codes, especially cyclic subspace codes, have attracted a wide attention in the past few decades due to their applications in error correction for random network coding. In 2016, Ben-Sasson et al. gave a systematic approach to constructing cyclic subspace codes by employing subspace polynomials. Inspired by Ben-Sasson’s idea, Chen et al. also provided some constructions of cyclic subspace codes in 2017. In this paper, two constructions of cyclic subspace codes are given to further improve the results of Chen and Roth et al. respectively. Consequently, we obtain more cyclic subspace codes with larger size of codewords without reducing the minimum distance.

子空间码，尤其是循环子空间码，由于其在随机网络编码的纠错中的应用，在过去的几十年中引起了广泛的关注。2016年，Ben-Sasson等人 给出了一种利用子空间多项式构造循环子空间码的系统方法。受本·萨森（Ben-Sasson）想法的启发，Chen等人。还提供了2017年循环子空间码的一些构造。为进一步改善Chen和Roth等人的结果，本文给出了两种循环子空间码的构造。分别。因此，我们在不减小最小距离的情况下获得了更多具有更大码字大小的循环子空间码。