Skip to main content
SpringerLink
Log in

New constant dimension subspace codes from parallel linkage construction and multilevel construction

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

A basic problem about a constant dimension subspace code is to find its maximal possible size Aq(n, d, k). In this paper, we investigate constant dimension codes with parallel linkage construction and multilevel construction and obtain new lower bounds on Aq(18,6,9). By combining the Johnson type bound, we obtain new lower bounds on Aq(17,6,8). These lower bounds are larger than previously best known bounds in Heinlein et al. (2019).

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. Antrobus, J., Gluesing-Luerssen, H.: Maximal Ferrers diagram codes: constructions and genericity considerations. IEEE Trans. Inform. Theory 65(10), 6204–6223 (2019)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Chen, H., He, X., Weng, J., et al.: New constructions of subspace codes using subsets of MRD codes in several blocks. IEEE Trans. Inf. Theory 66(9), 5317–5321 (2020)

    Article  MathSciNet  Google Scholar 

  5. de la Cruz, J., Gorla, E., Lopez, H.H., Ravagnani, A.: Rank distribution of Delsarte code. arXiv:1510.01008v1 (2019)

  6. Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Combin. Theory Ser. A 25(3), 226–241 (1978)

    Article  MathSciNet  Google Scholar 

  7. Etzion, T., Gorla, E., Ravagnani, A., Alberto, A.: Wachter, Optimal Ferrers diagram rank-metric codes. IEEE Trans. Inform. Theory 62(4), 1616–1630 (2016)

    Article  MathSciNet  Google Scholar 

  8. Etzion, T., Silberstein, N.: Error-correcting codes in projective spaces via rank-metric codes and ferrers diagrams. IEEE Trans. Inf. Theory 55(7), 2909–2919 (2009)

    Article  MathSciNet  Google Scholar 

  9. Etzion, T., Silberstein, N.: Codes and designs related to lifted MRD codes. IEEE Trans. Inf. Theory 59(2), 1004–1017 (2013)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  11. Gabidulin, È. M.: Theory of codes with maximum rank distance. Problem Inf. Transmiss 21(1), 3–16 (1985)

    MathSciNet  MATH  Google Scholar 

  12. Gluesing-Luerssen, H., Troha, C.: Construction of subspace codes through linkage. Adv. Math. Commun. 10(3), 525–540 (2016)

    Article  MathSciNet  Google Scholar 

  13. Heinlein, D., Kurz, S.: Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound. [Online] arXiv:1705.03835 (2017)

  14. Heinlein, D., Kurz, S.: Coset construction for subspace codes. IEEE Trans. Inform. Theory 63(12), 7651–7660 (2017)

    Article  MathSciNet  Google Scholar 

  15. Heinlein, D., Kiermaier, M., Kurz, S., Wassermann, A.: Tables of subspace codes. [Online] Available: arXiv:1601.02864v3 (2019)

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  18. Li, F.: Construction of constant dimension subspace codes by modifying linkage construction. IEEE Trans. Inf. Theory 66(5), 2760–2764 (2020)

    Article  MathSciNet  Google Scholar 

  19. Liu, S., Chang, Y., Feng, T.: Constructions for optimal Ferrers diagram rank-metric codes. IEEE Trans. Inform. Theory 65(7), 4115–4130 (2019)

    Article  MathSciNet  Google Scholar 

  20. Liu, S., Chang, Y., Feng, T.: Several classes of optimal Ferrers diagram rank-metric codes. Linear Algebra Appl. 581, 128–144 (2019)

    Article  MathSciNet  Google Scholar 

  21. Liu, S., Chang, Y., Feng, T.: Parallel multilevel constructions for constant dimension codes. IEEE Trans. Inf. Theory 66(11), 6884–6897 (2020)

    Article  MathSciNet  Google Scholar 

  22. Niu, Y., Yue, Q., Wu, Y.: Several kinds of large cyclic subspace codes via Sidon spaces, vol. 343 (2020)

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

    Article  MathSciNet  Google Scholar 

  24. Zhao, W., Tang, X.: A characterization of cyclic subspace codes via subspace polynomials. Finite Fields Their Appl. 57, 1–12 (2019)

    Article  MathSciNet  Google Scholar 

  25. Xu, L., Chen, H.: New constant-dimension subspace codes from maximum rank distance codes. IEEE Trans. Inf. Theory 64, 6315–6319 (2018)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  27. Zhang, T., Ge, G.: Constructions of optimal Ferrers diagram rank metric codes. Des. Codes Cryptogr. 87(1), 107–121 (2019)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, 211100, People’s Republic of China

    Yongfeng Niu & Daitao Huang

  2. Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing, 211100, People’s Republic of China

    Qin Yue

Authors
  1. Yongfeng Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qin Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daitao Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qin Yue.

Additional information

Publisher’s note

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

This article belongs to the Topical Collection: Boolean Functions and their Applications III

Guest Editors: Lilya Budaghyan, Claude Carlet, Tor Helleseth

This work was supported in part by National Natural Science Foundation of China (Nos. 61772015) and the Postgraduate Research & Practice Innovation Program of Jiangsu Province (No. KYCX20-0226).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Niu, Y., Yue, Q. & Huang, D. New constant dimension subspace codes from parallel linkage construction and multilevel construction. Cryptogr. Commun. 14, 201–214 (2022). https://doi.org/10.1007/s12095-021-00504-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-021-00504-z

Keywords

Mathematics Subject Classification (2010)

Search

Navigation