Further constructions of cyclic subspace codes

摘要

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.