Abstract
Due to the prior work by Köetter and Kschischang (IEEE Trans Inf Theory 54(8):3579–3591, 2008), subspace codes (especially constant-dimension codes, CDC for short) have attracted significant attention in recent years. The sub-code construction is currently one of the most popular constructions, which can be used to further improve the lower bounds for CDCs’ construction. In this paper, we show how to improve the construction of subspace codes from two parallel versions of the sub-code construction. This construction allows us to obtain larger size codes for a given minimum distance, which exceeds the latest improvements on the sub-code construction (Cossidente et al. in Adv Math Commun, 2021, https://doi.org/10.3934/amc.2021007; Lao et al. in Cryptogr Commun, 2021) in the cases including \({\mathcal {A}}_q(10,4,5),\ {\mathcal {A}}_q(14,6,7)\), and \({\mathcal {A}}_q(16,8,8)\), etc.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
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.
Cossidente A., Pavese F.: Subspace codes in PG(\(2n{-}1, q\)). Combinatorica 60(1), 1–23 (2014).
Cruz J.D.L., Gorla E., Lopez H.H., Ravagnani A.: Rank distribution of Delsarte codes. Mathematics (2015).
Delsarte Ph.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory 25(3), 226–241 (1978).
Etzion T., Silberstein N.: Codes and designs related to lifted MRD codes. IEEE Trans. Inf. Theory 59(2), 1004–1017 (2013).
Etzion T.: Problems on q-analogs in coding theory. arXiv:1305.6126 (2013).
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).
Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21(1), 3–16 (1985).
Gluesing-Luerssen H., Troha C.: Construction of subspace codes through linkage. Adv. Math. Commun. 10(3), 525–540 (2016).
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).
He X.: Construction of constant dimension code from two parallel versions of linkage construction. IEEE Commun. Lett. 24(11), 2392–2395 (2020). https://doi.org/10.1109/LCOMM.
He X., Chen Y.: A hierarchical-based greedy algorithm for Echelon-Ferrers construction. arXiv:1911.00508v2 (2019).
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). https://doi.org/10.1109/LCOMM.2021.3052734.
Heinlein D.: Generalized linkage construction for constant-dimension codes. IEEE Trans. Inf. Theory 67(2), 705–715 (2019). https://doi.org/10.1109/TIT.2020.3038272.
Heinlein D., Honold T., Kiermaier M., Kurz S., Wassermann A.: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Des. Codes Cryptogr. 87(2–3), 375–391 (2019).
Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspace codes. arXiv:1601.02864 (2016).
Heinlein D., Kurz S.: Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound. In: Coding Theory and Applications. ICMCTA 2017 (2017).
Honold T., Kiermaier M., Kurz S.: Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4. Mathematics (2013).
Koetter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579–3591 (2008).
Kurz S.: Lifted codes and the multilevel construction for constant dimension codes. arXiv:2004.14241 (2020).
Lao H., Chen H., Weng J., Tan X.: Parameter-controlled inserting constructions of constant dimension subspace codes. Cryptogr. Commun. (2021).
Li F.: Construction of constant dimension subspace codes by modifying linkage construction. IEEE Trans. Inf. Theory 66(5), 2760–2764 (2020). https://doi.org/10.1109/TIT.2019.2960343.
Liu S., Chang Y., Feng T.: Parallel multilevel constructions for constant dimension codes. IEEE Trans. Inf. Theory 66(11), 6884–6897 (2020). https://doi.org/10.1109/TIT.2020.3004315.
Silberstein N., Trautmann A.L.: 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).
Acknowledgements
Funding was provided by National Natural Science Foundation of China (Grant Nos. 61103244, 61872081, 61872083), Natural Science Foundation of Guangdong Province (Grant Nos. 2020A151501899, 2019A1515011123), Science and Technology Planning Project of Guangdong Province (Grant Nos. 190827105555406/2019ST032, 2019B010116001), the Key Scientific Research Project of Universities in Guangdong Province (Grant Nos. 2020ZDZX3028, 2020ZDZX3054), and the 2020 Li Ka Shing Foundation Cross-Disciplinary Research Grant (Grant No. 2020LKSFG05D).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue: On Coding Theory and Combinatorics: In Memory of Vera Pless”
Rights and permissions
About this article
Cite this article
He, X., Chen, Y., Zhang, Z. et al. Parallel sub-code construction for constant-dimension codes. Des. Codes Cryptogr. 90, 2991–3001 (2022). https://doi.org/10.1007/s10623-022-01065-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01065-9