Skip to main content
Springer Nature Link
Log in

Construction of constant dimension codes via improved inserting construction

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Constant dimension codes (CDCs), as special subspace codes, have attracted extensive attention due to their application at random network coding. In this paper, we present some variations on the insert construction method by changing the positions of some matrices. Those variations help us to construct more types of CDCs. By restricting the rank of matrices in rank metric codes, We can get that the union of these codes is still a CDC and the minimum subspace distance can be preserved. We generalize the previous results in He et al. (IEEE Commun Lett 25(5):1422–1426, 2021) and Lao et al. (arXiv:2008.09944v1, 2020) and obtain some new lower bounds of CDCs.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

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  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Cossidente, A., Kurz, S., Marino, G., Pavese, F.: Combining subspace codes. arXiv:1911.03387. (2019)

  4. 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  MATH  Google Scholar 

  5. 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  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Gabidulin, È.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21(1), 3–16 (1985)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. He, X.: Construction of constant dimension code from two parallel versions of linkage construction. IEEE Commun. Lett. 24(11), 2392–2395 (2020)

    Article  Google Scholar 

  11. He, X., Chen, Y., Zhang, Z., Zhou, K.: New construction for constant dimension subspace codes via a composite structure. IEEE Commun. Lett. 25(5), 1422–1426 (2021)

    Article  Google Scholar 

  12. He, X., Chen, Y., Zhang, Z.: Improving the linkage construction with Echelon-Ferrers for constant-dimension codes. IEEE Commun. Lett. 24(9), 1875–1879 (2020)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Heinlein, D., Kiermaier, M., Kurz, S., Wassermann, A.: Tables of subspace codes, [Online]. Available: https://arxiv.org/abs/1601.02864v3 (2019)

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

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Lao, H., Chen, H., Weng, J., Tan, X.: Parameter-controlled inserting constructions of constant dimension subspace codes. arXiv:2008.09944v1. (2020)

  18. Lao, H., Chen, H., Tan, X.: New constant dimension subspace codes from block inserting constructions. Cryptogr. Commun. (2021). https://doi.org/10.1007/s12095-021-00524-9

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. 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 

  21. Niu, Y., Yue, Q., Huang, D.: New constant dimension subspace codes from generalized inserting construction. IEEE Commun. Lett. 25(4), 1066–1069 (2021)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  23. Silva, D., Kschischang, F.R., Koetter, R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54(9), 3951–3967 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Funding

The paper is supported by National Natural Science Foundation of China (Nos. 61772015, 62172219), the Postgraduate Research & Practice Innovation Program of Jiangsu Province (No. KYCX20-0226).

Author information

Authors and Affiliations

  1. School of Computer Science and Artificial Intelligence, Changzhou University, Changzhou, 213164, People’s Republic of China

    Yongfeng Niu

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

    Qin Yue

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

    Daitao Huang

Authors
  1. Yongfeng Niu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Qin Yue
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Daitao Huang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yongfeng Niu.

Additional information

Publisher's Note

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

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. Construction of constant dimension codes via improved inserting construction. AAECC 34, 1045–1062 (2023). https://doi.org/10.1007/s00200-021-00537-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-021-00537-0

Keywords

Mathematics Subject Classification