{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:08:12Z","timestamp":1761800892325,"version":"build-2065373602"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301670","12301670","61971243"],"award-info":[{"award-number":["12301670","12301670","61971243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012580","name":"Natural Science Foundation of Tianjin-Science and Technology Correspondent Project","doi-asserted-by":"publisher","award":["23JCQNJC00050","23JCQNJC00050"],"award-info":[{"award-number":["23JCQNJC00050","23JCQNJC00050"]}],"id":[{"id":"10.13039\/501100012580","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Research Project of Tianjin Education Commission","award":["2022KJ075","2022KJ075"],"award-info":[{"award-number":["2022KJ075","2022KJ075"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities of China","doi-asserted-by":"crossref","award":["3122023QD25","3122023QD25"],"award-info":[{"award-number":["3122023QD25","3122023QD25"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ANR BARRACUDA","award":["ANR-21-CE39-0009"],"award-info":[{"award-number":["ANR-21-CE39-0009"]}]},{"name":"National Key Research and Development Program of China","award":["2018YFA0704703"],"award-info":[{"award-number":["2018YFA0704703"]}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin","doi-asserted-by":"crossref","award":["20JCZDJC00610"],"award-info":[{"award-number":["20JCZDJC00610"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10623-025-01666-0","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T07:14:07Z","timestamp":1754291647000},"page":"4833-4856","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multilevel inserting constructions for constant dimension subspace codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Gang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihem","family":"Mesnager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,4]]},"reference":[{"key":"1666_CR1","doi-asserted-by":"publisher","first-page":"6204","DOI":"10.1109\/TIT.2019.2926256","volume":"65","author":"J Antrobus","year":"2019","unstructured":"Antrobus J., Gluesing-Luerssen H.: Maximal Ferrers diagram codes: constructions and genericity considerations. IEEE Trans. Inf. Theory 65, 6204\u20136223 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR2","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, 5317\u20135321 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR3","doi-asserted-by":"publisher","first-page":"536","DOI":"10.3934\/amc.2021007","volume":"17","author":"A Cossidente","year":"2023","unstructured":"Cossidente A., Kurz S., Marino G., Pavese F.: Combining subspace codes. Adv. Math. Commun. 17, 536\u2013550 (2023).","journal-title":"Adv. Math. Commun."},{"key":"1666_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Combin. Theory A 25, 226\u2013241 (1978).","journal-title":"J. Combin. Theory A"},{"key":"1666_CR5","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, 2909\u20132919 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR6","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TIT.2016.2522971","volume":"62","author":"T Etzion","year":"2016","unstructured":"Etzion T., Gorla E., Ravagnani A., Wachter-Zeh A.: Optimal Ferrers diagram rank-metric codes. IEEE Trans. Inf. Theory 62, 1616\u20131630 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR7","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, 1004\u20131017 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR8","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TIT.2010.2095232","volume":"57","author":"T Etzion","year":"2011","unstructured":"Etzion T., Vardy A.: Error-correcting codes in projective spaces. IEEE Trans. Inf. Theory 57, 1165\u20131173 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR9","first-page":"3","volume":"21","author":"\u00c8M Gabidulin","year":"1985","unstructured":"Gabidulin \u00c8.M.: Theory of codes with maximum rank distance. Probl. Inf. Transmiss. 21, 3\u201316 (1985).","journal-title":"Probl. Inf. Transmiss."},{"key":"1666_CR10","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1109\/TIT.2010.2048447","volume":"56","author":"M Gadouleau","year":"2010","unstructured":"Gadouleau M., Yan Z.: Constant-rank codes and their connection to constant-dimension codes. IEEE Trans. Inf. Theory 56, 3207\u20133216 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR11","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, 525\u2013540 (2016).","journal-title":"Adv. Math. Commun."},{"key":"1666_CR12","doi-asserted-by":"publisher","first-page":"1750131","DOI":"10.1142\/S0219498817501316","volume":"16","author":"E Gorla","year":"2017","unstructured":"Gorla E., Ravagnani A.: Subspace codes from Ferrers diagrams. J. Algebra Appl. 16, 1750131 (2017).","journal-title":"J. Algebra Appl."},{"key":"1666_CR13","doi-asserted-by":"publisher","first-page":"4822","DOI":"10.1109\/TIT.2019.2905002","volume":"65","author":"D Heinlein","year":"2019","unstructured":"Heinlein D.: New LMRD code bounds for constant dimension codes and improved constructions. IEEE Trans. Inf. Theory 65, 4822\u20134830 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR14","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/TIT.2020.3038272","volume":"67","author":"D Heinlein","year":"2021","unstructured":"Heinlein D.: Generalized linkage construction for constant-dimension codes. IEEE Trans. Inf. Theory 67, 705\u2013715 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR15","doi-asserted-by":"publisher","first-page":"7651","DOI":"10.1109\/TIT.2017.2753822","volume":"63","author":"D Heinlein","year":"2017","unstructured":"Heinlein D., Kurz S.: Coset construction for subspace codes. IEEE Trans. Inf. Theory 63, 7651\u20137660 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR16","unstructured":"Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspace codes. http:\/\/subspacecodes.uni-bayreuth.de."},{"key":"1666_CR17","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1007\/s10623-022-01065-9","volume":"90","author":"X He","year":"2022","unstructured":"He X., Chen Y., Zhang Z., Zhou K.: Parallel sub-code construction for constant-dimension codes. Des. Codes Cryptogr. 90, 2991\u20133001 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1666_CR18","doi-asserted-by":"publisher","first-page":"4051","DOI":"10.1109\/TIT.2020.2968832","volume":"66","author":"M Kiermaier","year":"2020","unstructured":"Kiermaier M., Kurz S.: On the lengths of divisible codes. IEEE Trans. Inf. Theory 66, 4051\u20134060 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR19","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R K\u00f6tter","year":"2008","unstructured":"K\u00f6tter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54, 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR20","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, 6884\u20136897 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TIT.2022.3200052","volume":"69","author":"S Liu","year":"2023","unstructured":"Liu S., Ji L.: Double multilevel constructions for constant dimension codes. IEEE Trans. Inf. Theory 69, 157\u2013168 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR22","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.laa.2019.07.011","volume":"581","author":"S Liu","year":"2019","unstructured":"Liu S., Chang Y., Feng T.: Several classes of optimal Ferrers diagram rank-metric codes. Linear Algebra Appl. 581, 128\u2013144 (2019).","journal-title":"Linear Algebra Appl."},{"key":"1666_CR23","doi-asserted-by":"publisher","first-page":"4115","DOI":"10.1109\/TIT.2019.2894401","volume":"65","author":"S Liu","year":"2019","unstructured":"Liu S., Chang Y., Feng T.: Constructions for optimal Ferrers diagram rank-metric codes. IEEE Trans. Inf. Theory 65, 4115\u20134130 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR24","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1109\/LCOMM.2020.3046042","volume":"25","author":"Y Niu","year":"2021","unstructured":"Niu Y., Yue Q., Huang D.: New constant dimension subspace codes from generalized inserting construction. IEEE Commun. Lett. 25, 1066\u20131069 (2021).","journal-title":"IEEE Commun. Lett."},{"key":"1666_CR25","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12095-021-00504-z","volume":"14","author":"Y Niu","year":"2022","unstructured":"Niu Y., Yue Q., Huang D.: New constant dimension subspace codes from parallel linkage construction and multilevel construction. Cryptogr. Commun. 14, 201\u2013214 (2022).","journal-title":"Cryptogr. Commun."},{"key":"1666_CR26","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"RM Roth","year":"1991","unstructured":"Roth R.M.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inf. Theory 37, 328\u2013336 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.3934\/amc.2011.5.177","volume":"5","author":"N Silberstein","year":"2011","unstructured":"Silberstein N., Etzion T.: Large constant dimension codes and lexicodes. Adv. Math. Commun. 5, 177\u2013189 (2011).","journal-title":"Adv. Math. Commun."},{"key":"1666_CR28","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, 3937\u20133953 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR29","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva D., Kschischang F.R., K\u00f6tter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54, 3951\u20133967 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR30","unstructured":"Trautmann A.L., Rosenthal J.: New improvements on the Echelon Ferrers construction. In: Proc. 19th Int. Symp. Math. Theory Netw. Syst., July 2010, pp. 405\u2013408."},{"key":"1666_CR31","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, 6315\u20136319 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1666_CR32","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.3934\/amc.2022056","volume":"16","author":"S Yu","year":"2022","unstructured":"Yu S., Ji L., Liu S.: Bilateral multilevel construction of constant dimension codes. Adv. Math. Commun. 16, 1165\u20131183 (2022).","journal-title":"Adv. Math. Commun."},{"key":"1666_CR33","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10623-018-0491-4","volume":"87","author":"T Zhang","year":"2019","unstructured":"Zhang T., Ge G.: Constructions of optimal Ferrers diagram rank metric codes. Des. Codes Cryptogr. 87, 107\u2013121 (2019).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01666-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01666-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01666-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:03:15Z","timestamp":1761800595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01666-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,4]]},"references-count":33,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1666"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01666-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,8,4]]},"assertion":[{"value":"13 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}