Skip to main content
SpringerLink
Log in

Further constructions of cyclic subspace codes

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahlswede, R., Aydinian, H.K., Khachatrian, L.H.: On perfect codes and related concepts. Des. Codes Cryptogr. 22(3), 221–237 (2001)

  2. Bachoc, C., Serra, O.: Zémor: An analogue of Vosper’s theorem for extension fields. Math. Proc. Cambridge Philos. Soc. 163(3), 423–452 (2017)

  3. Ben-Sasson E., Etzion T., Gabizon A., Raviv N.: Subspace polynomials and cyclic subspace codes. IEEE Trans. Inf. Theory 62(3), 1157–1165 (2016)

  4. Braun, M., Etzion, T., Ostergard, P., Vardy, A., Wasserman, A.: Existence of q-analogs of Steiner systems. Forum Math. Pi. 4(e7), 1–14 (2016)

  5. Chen B., Liu H.: Constructions of cyclic constant dimension codes. Des. Codes Cryptogr., 1–13. https://doi.org/10.1007/s10623-017-0394-9 (2017)

  6. Cheng, Q., Gao, S., Wan, D.: Constructing high order elements through subspace polynomials. In: Proceedings of 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1463–1547 (2012)

  7. Chihara, L.: On the zeros of the Askey-Wilson polynomials, with applications to coding theory. SIAM J. Math. Anal. 18(1), 191–207 (1987)

  8. Etzion, T., Vardy, A.: Error-correcting codes in projective space. IEEE Trans. Inf. Theory 57(2), 1165–1173 (2011)

  9. Gluesing-Luerssen, H., Morrison, K., Troha, C.: Cyclic orbit codes and stabilizer subfields. Adv. Math. Commun. 9(2), 177–197 (2015)

  10. Kohnert, A., Kurz, S.: Construction of large constant dimension codes with a prescribed minimum distance. In: Mathematical Methods in Computer Science, vol. 5393. Lecture Notes in Computer Science, pp. 31–42. Springer, Berlin (2008)

  11. Kötter, R., Kschischang, F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579–3591 (2008)

  12. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (2008)

  13. Otal, K., Özbudak, F.: Cyclic subspace codes via subspace polynomials. Des. Codes Cryptogr. 85(2), 191–204 (2017)

  14. Roth, R.M., Raviv, N., Tamo, I.: Construction of Sidon spaces with Applications to Coding. IEEE Trans. Inf. Theory 64(6), 4412–4422 (2018)

  15. Schwartz, M., Etzion, T.: Codes and anticodes in the Grassman graph. J. Combin. Theory A 97(1), 27–42 (2002)

  16. Trautmann, A.L., Manganiello, F., Braun, M., Rosenthal, J.: Cyclic orbit codes. IEEE Trans. Inf. Theory 59(11), 7386–7404 (2013)

Download references

Acknowledgments

The authors would like to thank the editor for his excellent work and the anonymous reviewers for their useful comments and helpful suggestions which improve the presentation of this paper. Moreover, the authors are particularly grateful to Dr. Gaojun Luo for his invaluable discussions on this topic.

Author information

Authors and Affiliations

  1. Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing, 211100, China

    He Zhang & Xiwang Cao

  2. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China

    Xiwang Cao

Authors
  1. He Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiwang Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiwang Cao.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by the National Natural Science Foundation of China (Grant Nos. 11771007).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, H., Cao, X. Further constructions of cyclic subspace codes. Cryptogr. Commun. 13, 245–262 (2021). https://doi.org/10.1007/s12095-020-00463-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-020-00463-x

Keywords

Mathematics Subject Classification (2010)

Search

Navigation