Skip to main content
SpringerLink
Log in

Cyclic constant dimension subspace codes via the sum of Sidon spaces

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Subspace codes are of great use in noncoherent linear network coding (Katti et al in ACM SIGCOMM Comput Commun Rev 38(4):401–412, 2008; Kötter and Kschischang in IEEE Trans Inform Theory 54(8):3579–3591, 2008; Silva et al. in IEEE Trans Inform Theory 54(9):3951–3967, 2008). As a particular subclass of subspace codes, cyclic constant dimension subspace codes can be encoded and decoded more efficiently. There is an increased interest in constructing cyclic constant dimension subspace codes whose sizes and minimum distances are as large as possible. Roth et al. (IEEE Trans Inform Theory 64(6):4412–4422, 2017) constructed several cyclic constant dimension subspace codes using Sidon spaces. In this paper, we present a criterion which can be used to determine whether or not the sum of some distinct Sidon spaces is again a Sidon space. Based on this result, we obtain cyclic constant dimension subspace codes via the sum of several Sidon spaces. Our results generalize some results in Niu et al. (Discret Math 343(5):111788, 2020) and Roth et al. (IEEE Trans Inform Theory 64(6):4412–4422, 2017).

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. Bachoc C., Serra O., Zemor G.: An analogue of Vosper’s theorem for extension fields. Math. Proc. Camb. Philos. Soc. 163(3), 423–452 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  2. Ben-Sasson E., Kopparty S., Radhakrishnan J.: Subspace polynomials and limits to list decoding of Reed–Solomon codes. IEEE Trans. Inform. Theory 56(1), 113–120 (2010).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen B., Liu H.: Constructions of cyclic constant dimension codes. Des. Codes Cryptogr. 86(6), 1267–1279 (2017).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Feng T., Wang Y.: New constructions of large cyclic subspace codes and Sidon spaces. Discret. Math. 344(4), 112273 (2021).

    Article  MathSciNet  MATH  Google Scholar 

  7. Gluesing-Luerssen H., Lehmann H.: Distance distributions of cyclic orbit codes. Des. Codes Cryptogr. 89, 447–470 (2021).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Gluesing-Luerssen H., Lehmann H.: Automorphism groups and isometries for cyclic orbit codes. arXiv:2101.09548

  10. Katti S., Katabi D., Balakrishnan H., Medard M.: Symbol-level network coding for wireless mesh networks. ACM SIGCOMM Comput. Commun. Rev. 38(4), 401–412 (2008).

    Article  Google Scholar 

  11. Kohnert A., Kurz S.: Constructing of large constant dimension codes with a prescribed minimum distance. Math. Methods Comput. Sci. 5393, 31–42 (2008).

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997).

    MATH  Google Scholar 

  14. Niu Y., Yue Q., Wu Y.: Several kinds of large cyclic subspace codes via Sidon spaces. Discret. Math. 343(5), 111788 (2020).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Rosenthal J., Trautmann A.L.: A complete characterization of irreducible cyclic orbit codes and their Plücker embedding. Des. Codes Cryptogr. 66, 275–289 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  17. Roth R., Raviv N., Tamo I.: Construction of Sidon spaces with applications to coding. IEEE Trans. Inform. Theory 64(6), 4412–4422 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  18. Silva D., Kschischang F.R., Kötter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inform. Theory 54(9), 3951–3967 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  19. Trautmann A.L.: Isometry and automorphisms of constant dimension codes. Adv. Math. Commun. 7(2), 147–160 (2013).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Xia S., Fu F.: Johnson type bounds on constant dimension codes. Des. Codes Cryptogr. 50(2), 163–172 (2009).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to express their deepest gratitude to the editor and the anonymous reviewers for their precious comments and valuable suggestions that have helped improve this paper substantially. This work was supported by NSFC (Grant Nos. 11871025, 12271199).

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Central China Normal University, Wuhan, 430079, China

    Yun Li & Hongwei Liu

Authors
  1. Yun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongwei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongwei Liu.

Additional information

Communicated by V. A. Zinoviev.

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, Y., Liu, H. Cyclic constant dimension subspace codes via the sum of Sidon spaces. Des. Codes Cryptogr. 91, 1193–1207 (2023). https://doi.org/10.1007/s10623-022-01146-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-022-01146-9

Keywords

Mathematics Subject Classification

Search

Navigation