Research Article
A new construction of cyclic subspace codes
https://doi.org/10.21203/rs.3.rs-3908812/v1
This work is licensed under a CC BY 4.0 License
published 13 Aug, 2024
Read the published version in Cryptography and Communications →
You are reading this latest preprint version
Subspace codes have attracted a lot of attention in the last few decades due to their applications innoncoherent linear network coding, in particular cyclic subspace codes can be encoded and decoded moreefficiently because of their special algebraic structure. Using the union of several cyclic subspace codes, wepresent a family of cyclic subspace codes with minimum distance 2k − 2 and size seqk(qk − 1)s−1(qn − 1), where k|n, n/k ≥ 2s + 1, s ≥ 2, e = ⌈n/2sk⌉ − 1.
Constant dimension codes
subspace codes
Sidon spaces
Random network coding
No competing interests reported.
published 13 Aug, 2024
Read the published version in Cryptography and Communications →
Editorial decision: Revision requested
15 Jun, 2024
Reviews received at journal
13 Jun, 2024
Reviews received at journal
01 May, 2024
Reviewers agreed at journal
09 Feb, 2024
Reviewers agreed at journal
09 Feb, 2024
Reviewers invited by journal
08 Feb, 2024
Editor assigned by journal
01 Feb, 2024
Submission checks completed at journal
31 Jan, 2024
First submitted to journal
29 Jan, 2024
You are reading this latest preprint version