Cyclic subspace codes via subspace polynomials
- 536 Downloads
Subspace codes have been intensely studied in the last decade due to their application in random network coding. In particular, cyclic subspace codes are very useful subspace codes with their efficient encoding and decoding algorithms. In a recent paper, Ben-Sasson et al. gave a systematic construction of subspace codes using subspace polynomials. In this paper, we mainly generalize and improve their result so that we can obtain larger codes for fixed parameters and also we can increase the density of some possible parameters. In addition, we give some relative remarks and explicit examples.
KeywordsRandom network coding Subspace codes Constant dimension codes Grassmannian Cyclic subspace codes Subspace polynomials
Mathematics Subject Classification11T71 11T06
We would like to thank the anonymous referees for their insightful and helpful comments that improved the presentation of this paper. In addition, we would like to thank COST Action IC 1104 and the first author thanks TÜBİTAK BİDEB 2211.
- 2.Braun M., Etzion T., Ostergard P., Vardy A., Wasserman A.: Existence of q-analogues of Steiner systems. arXiv:1304.1462v2 [math.CO].
- 6.Kohnert A., Kurz S.: Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance. In: Lecture Notes in Computer Science, vol. 5393, pp. 31–42, Springer, Berlin (2008).Google Scholar