Further constructions of large cyclic subspace codes via Sidon spaces

Abstract

Subspace codes have played an important role in error correction for random network coding recently. Particularly, large cyclic subspace codes with the optimal minimum distance can be applied efficiently in encoding and decoding algorithms. Hence, our goal is to discover cyclic subspace codes such that both the code sizes and the code minimum distances are as large as possible. By exploring the idea of constructing cyclic subspace codes utilizing Sidon spaces presented in Feng and Wang (2021) [11], we investigate a new large cyclic subspace codes to extend and improve their works. Moreover, these codes still maintain the optimality of minimum distance.