{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:15:05Z","timestamp":1761808505864,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61103244"],"award-info":[{"award-number":["61103244"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2020A151501899"],"award-info":[{"award-number":["2020A151501899"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012245","name":"Science and Technology Planning Project of Guangdong Province","doi-asserted-by":"publisher","award":["190827105555406\/2019ST032, 2019B010116001"],"award-info":[{"award-number":["190827105555406\/2019ST032, 2019B010116001"]}],"id":[{"id":"10.13039\/501100012245","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Key Scientific Research Project of Universities in Guangdong Province","award":["2020ZDZX3028"],"award-info":[{"award-number":["2020ZDZX3028"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10623-022-01065-9","type":"journal-article","created":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T17:06:10Z","timestamp":1655312770000},"page":"2991-3001","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Parallel sub-code construction for constant-dimension codes"],"prefix":"10.1007","volume":"90","author":[{"given":"Xianmang","family":"He","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8849-6087","authenticated-orcid":false,"given":"Yindong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zusheng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Kunxiao","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"issue":"9","key":"1065_CR1","doi-asserted-by":"publisher","first-page":"5317","DOI":"10.1109\/TIT.2020.2975776","volume":"66","author":"H Chen","year":"2020","unstructured":"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\u20135321 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1065_CR2","doi-asserted-by":"publisher","unstructured":"Cossidente A., Kurz S., Marino G., Pavese F.: Combining subspace codes. Adv. Math. Commun. (2021). https:\/\/doi.org\/10.3934\/amc.2021007.","DOI":"10.3934\/amc.2021007"},{"issue":"1","key":"1065_CR3","first-page":"1","volume":"60","author":"A Cossidente","year":"2014","unstructured":"Cossidente A., Pavese F.: Subspace codes in PG($$2n{-}1, q$$). Combinatorica 60(1), 1\u201323 (2014).","journal-title":"Combinatorica"},{"key":"1065_CR4","unstructured":"Cruz J.D.L., Gorla E., Lopez H.H., Ravagnani A.: Rank distribution of Delsarte codes. Mathematics (2015)."},{"issue":"3","key":"1065_CR5","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"Ph Delsarte","year":"1978","unstructured":"Delsarte Ph.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory 25(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory"},{"issue":"2","key":"1065_CR6","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1109\/TIT.2012.2220119","volume":"59","author":"T Etzion","year":"2013","unstructured":"Etzion T., Silberstein N.: Codes and designs related to lifted MRD codes. IEEE Trans. Inf. Theory 59(2), 1004\u20131017 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1065_CR7","unstructured":"Etzion T.: Problems on q-analogs in coding theory. arXiv:1305.6126 (2013)."},{"issue":"7","key":"1065_CR8","doi-asserted-by":"publisher","first-page":"2909","DOI":"10.1109\/TIT.2009.2021376","volume":"55","author":"T Etzion","year":"2009","unstructured":"Etzion T., Silberstein N.: Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. IEEE Trans. Inf. Theory 55(7), 2909\u20132919 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1065_CR9","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21(1), 3\u201316 (1985).","journal-title":"Probl. Inf. Transm."},{"issue":"3","key":"1065_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.3934\/amc.2016023","volume":"10","author":"H Gluesing-Luerssen","year":"2016","unstructured":"Gluesing-Luerssen H., Troha C.: Construction of subspace codes through linkage. Adv. Math. Commun. 10(3), 525\u2013540 (2016).","journal-title":"Adv. Math. Commun."},{"issue":"9","key":"1065_CR11","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/LCOMM.2020.2997928","volume":"24","author":"X He","year":"2020","unstructured":"He X., Chen Y., Zhang Z.: Improving the linkage construction with Echelon-Ferrers for constant-dimension codes. IEEE Commun. Lett. 24(9), 1875\u20131879 (2020).","journal-title":"IEEE Commun. Lett."},{"issue":"11","key":"1065_CR12","doi-asserted-by":"publisher","first-page":"2392","DOI":"10.1109\/LCOMM","volume":"24","author":"X He","year":"2020","unstructured":"He X.: Construction of constant dimension code from two parallel versions of linkage construction. IEEE Commun. Lett. 24(11), 2392\u20132395 (2020). https:\/\/doi.org\/10.1109\/LCOMM.","journal-title":"IEEE Commun. Lett."},{"key":"1065_CR13","unstructured":"He X., Chen Y.: A hierarchical-based greedy algorithm for Echelon-Ferrers construction. arXiv:1911.00508v2 (2019)."},{"issue":"5","key":"1065_CR14","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.1109\/LCOMM.2021.3052734","volume":"25","author":"X He","year":"2021","unstructured":"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\u20131426 (2021). https:\/\/doi.org\/10.1109\/LCOMM.2021.3052734.","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"1065_CR15","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/TIT.2020.3038272","volume":"67","author":"D Heinlein","year":"2019","unstructured":"Heinlein D.: Generalized linkage construction for constant-dimension codes. IEEE Trans. Inf. Theory 67(2), 705\u2013715 (2019). https:\/\/doi.org\/10.1109\/TIT.2020.3038272.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2\u20133","key":"1065_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10623-018-0544-8","volume":"87","author":"D Heinlein","year":"2019","unstructured":"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\u20133), 375\u2013391 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1065_CR17","unstructured":"Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspace codes. arXiv:1601.02864 (2016)."},{"key":"1065_CR18","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1007\/978-3-319-66278-7_15"},{"key":"1065_CR19","unstructured":"Honold T., Kiermaier M., Kurz S.: Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4. Mathematics (2013)."},{"issue":"8","key":"1065_CR20","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1065_CR21","unstructured":"Kurz S.: Lifted codes and the multilevel construction for constant dimension codes. arXiv:2004.14241 (2020)."},{"key":"1065_CR22","unstructured":"Lao H., Chen H., Weng J., Tan X.: Parameter-controlled inserting constructions of constant dimension subspace codes. Cryptogr. Commun. (2021)."},{"issue":"5","key":"1065_CR23","doi-asserted-by":"publisher","first-page":"2760","DOI":"10.1109\/TIT.2019.2960343","volume":"66","author":"F Li","year":"2020","unstructured":"Li F.: Construction of constant dimension subspace codes by modifying linkage construction. IEEE Trans. Inf. Theory 66(5), 2760\u20132764 (2020). https:\/\/doi.org\/10.1109\/TIT.2019.2960343.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1065_CR24","doi-asserted-by":"publisher","first-page":"6884","DOI":"10.1109\/TIT.2020.3004315","volume":"66","author":"S Liu","year":"2020","unstructured":"Liu S., Chang Y., Feng T.: Parallel multilevel constructions for constant dimension codes. IEEE Trans. Inf. Theory 66(11), 6884\u20136897 (2020). https:\/\/doi.org\/10.1109\/TIT.2020.3004315.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1065_CR25","doi-asserted-by":"publisher","first-page":"3937","DOI":"10.1109\/TIT.2015.2435743","volume":"61","author":"N Silberstein","year":"2015","unstructured":"Silberstein N., Trautmann A.L.: Subspace codes based on graph matchings, Ferrers diagrams, and pending blocks. IEEE Trans. Inf. Theory 61(7), 3937\u20133953 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1065_CR26","doi-asserted-by":"publisher","first-page":"6315","DOI":"10.1109\/TIT.2018.2839596","volume":"64","author":"L Xu","year":"2018","unstructured":"Xu L., Chen H.: New constant-dimension subspace codes from maximum rank-distance codes. IEEE Trans. Inf. Theory 64(9), 6315\u20136319 (2018).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01065-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01065-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01065-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T08:09:27Z","timestamp":1668154167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01065-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,15]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1065"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01065-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,6,15]]},"assertion":[{"value":"9 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}