Abstract
Constant dimension codes (CDCs) have received extensive attention due to their applications in random network coding. The basic problem for CDCs is to determine the maximal possible cardinality \(A_q(n,d,k)\) of CDC for given parameters q, n, d and k. In this paper, we present some variations on the generalized block inserting construction method. These constructions insert more subspaces into the CDC from the parallel linkage construction via changing the parameters and shifting the positions of some small matrices. Our constructions help us to obtain CDCs with larger cardinalities and some new lower bounds for CDCs which are better than the previously best known ones.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
References
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).
Cossidente A., Kurz S., Marino G., Pavese F.: Combining subspace codes. Adv. Math. Commun. (2021). https://doi.org/10.3934/amc.2021007.
Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory A 25(3), 226–241 (1978).
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).
Etzion T., Silberstein N.: Codes and designs related to lifted MRD codes. IEEE Trans. Inf. Theory 59(2), 1004–1017 (2013).
Gabidulin È.M.: Theory of codes with maximum rank distance. Probl. Peredachi Inform. 21(1), 3–16 (1985).
Gluesing-Luerssen H., Troha C.: Construction of subspace codes through linkage. Adv. Math. Commun. 10(3), 525–540 (2016).
Gorla E., Ravagnani A.: Subspace codes from Ferrers diagrams. J. Algebra Appl. 16(7), 1750131 (2017).
Greferath M., Pavčević M.O., Silberstein N., Vázquez-Castro M.Á.: Network Coding and Subspace Designs. Springer, Cham (2018).
He X.: Construction of constant dimension codes from two parallel versions of linkage construction. IEEE Commun. Lett. 24(11), 2392–2395 (2020).
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).
Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspace codes (2016). arXiv:1601.02864.
Heinlein D.: Generalized linkage construction for constant-dimension codes. IEEE Trans. Inf. Theory 67(2), 705–715 (2021).
Heinlein D., Kurz S.: Coset construction for subspace codes. IEEE Trans. Inf. Theory 63(12), 7651–7660 (2017).
Hong X., Cao X.: Generalized block inserting for constructing new constant dimension codes. Cryptogr. Commun. (2022). https://doi.org/10.1007/s12095-022-00590-7.
Köetter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579–3591 (2008).
Lao H., Chen H.: New constant dimension subspace codes from multilevel linkage construction. Adv. Math. Commun. (2022). https://doi.org/10.3934/amc.2022039.
Lao H., Chen H., Weng J., Tan X.: Parameter-controlled inserting constructions of constant dimension subspace codes (2020). arXiv:2008.09944.
Lao H., Chen H., Tan X.: New constant dimension subspace codes from block inserting constructions. Cryptogr. Commun. 14(1), 87–99 (2022).
Li F.: Construction of constant dimension subspace codes by modifying linkage construction. IEEE Trans. Inf. Theory 66(5), 1760–1764 (2020).
Liu S., Chang Y., Feng T.: Parallel multilevel constructions for constant dimension codes. IEEE Trans. Inf. Theory 66(11), 6884–6897 (2020).
Niu Y., Yue Q., Huang D.: New constant dimension subspace codes from generalized inserting construction. IEEE Commun. Lett. 25(4), 1066–1069 (2021).
Niu Y., Yue Q., Huang D.: New constant dimension subspace codes from parallel linkage construction and multilevel construction. Cryptogr. Commun. 14(2), 201–214 (2022).
Niu Y., Yue Q., Huang D.: Construction of constant dimension codes via improved inserting construction. Appl. Algebra Eng. Commun. Comput. (2021). https://doi.org/10.1007/s00200-021-00537-0.
Silberstein N., Trautmann A.: Subspace codes based on graph matchings, Ferrers diagrams, and pending blocks. IEEE Trans. Inf. Theory 61(7), 3937–3953 (2015).
Xu L., Chen H.: New constant-dimension subspace codes from maximum rank distance codes. IEEE Trans. Inf. Theory 64(9), 6315–6319 (2018).
Zhang H., Cao X.: Further constructions of cyclic subspace codes. Cryptogr. Commun. 13(2), 245–262 (2021).
Acknowledgements
The authors would like to express their grateful thankfulness to Professor Hao Chen and Qin Yue for helpful discussion. The authors are very grateful to the anonymous referees for their carefully reading and helpful suggestions which improved the quality of the paper. This research is supported by National Natural Science Foundation of China under Grant Nos. 11771007, 12171241.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by T. Feng.
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 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.
About this article
Cite this article
Hong, X., Cao, X. Improved generalized block inserting construction of constant dimension codes. Des. Codes Cryptogr. 91, 475–495 (2023). https://doi.org/10.1007/s10623-022-01117-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01117-0