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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
