{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T01:29:52Z","timestamp":1771637392067,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"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":["11771007"],"award-info":[{"award-number":["11771007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171241"],"award-info":[{"award-number":["12171241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10623-022-01117-0","type":"journal-article","created":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T10:04:06Z","timestamp":1664791446000},"page":"475-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improved generalized block inserting construction of constant dimension codes"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5890-4035","authenticated-orcid":false,"given":"Xiaoqin","family":"Hong","sequence":"first","affiliation":[]},{"given":"Xiwang","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"issue":"9","key":"1117_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":"1117_CR2","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2021007","author":"A Cossidente","year":"2021","unstructured":"Cossidente A., Kurz S., Marino G., Pavese F.: Combining subspace codes. Adv. Math. Commun. (2021). https:\/\/doi.org\/10.3934\/amc.2021007.","journal-title":"Math. Commun."},{"issue":"3","key":"1117_CR3","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. Comb. Theory A 25(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory A"},{"issue":"7","key":"1117_CR4","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":"2","key":"1117_CR5","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"},{"issue":"1","key":"1117_CR6","first-page":"3","volume":"21","author":"\u00c8M Gabidulin","year":"1985","unstructured":"Gabidulin \u00c8.M.: Theory of codes with maximum rank distance. Probl. Peredachi Inform. 21(1), 3\u201316 (1985).","journal-title":"Probl. Peredachi Inform."},{"issue":"3","key":"1117_CR7","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":"7","key":"1117_CR8","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(7), 1750131 (2017).","journal-title":"J. Algebra Appl."},{"key":"1117_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3","volume-title":"Network Coding and Subspace Designs","author":"M Greferath","year":"2018","unstructured":"Greferath M., Pav\u010devi\u0107 M.O., Silberstein N., V\u00e1zquez-Castro M.\u00c1.: Network Coding and Subspace Designs. Springer, Cham (2018)."},{"issue":"11","key":"1117_CR10","doi-asserted-by":"publisher","first-page":"2392","DOI":"10.1109\/LCOMM.2020.3012488","volume":"24","author":"X He","year":"2020","unstructured":"He X.: Construction of constant dimension codes from two parallel versions of linkage construction. IEEE Commun. Lett. 24(11), 2392\u20132395 (2020).","journal-title":"IEEE Commun. Lett."},{"issue":"5","key":"1117_CR11","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).","journal-title":"IEEE Commun. Lett."},{"key":"1117_CR12","unstructured":"Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspace codes (2016). arXiv:1601.02864."},{"issue":"2","key":"1117_CR13","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(2), 705\u2013715 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1117_CR14","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(12), 7651\u20137660 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1117_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-022-00590-7","author":"X Hong","year":"2022","unstructured":"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.","journal-title":"Cryptogr. Commun."},{"issue":"8","key":"1117_CR16","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R K\u00f6etter","year":"2008","unstructured":"K\u00f6etter 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":"1117_CR17","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022039","author":"H Lao","year":"2022","unstructured":"Lao H., Chen H.: New constant dimension subspace codes from multilevel linkage construction. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022039.","journal-title":"Adv. Math. Commun."},{"key":"1117_CR18","unstructured":"Lao H., Chen H., Weng J., Tan X.: Parameter-controlled inserting constructions of constant dimension subspace codes (2020). arXiv:2008.09944."},{"issue":"1","key":"1117_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s12095-021-00524-9","volume":"14","author":"H Lao","year":"2022","unstructured":"Lao H., Chen H., Tan X.: New constant dimension subspace codes from block inserting constructions. Cryptogr. Commun. 14(1), 87\u201399 (2022).","journal-title":"Cryptogr. Commun."},{"issue":"5","key":"1117_CR20","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1109\/TIT.2019.2950299","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), 1760\u20131764 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1117_CR21","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).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1117_CR22","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(4), 1066\u20131069 (2021).","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"1117_CR23","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(2), 201\u2013214 (2022).","journal-title":"Cryptogr. Commun."},{"key":"1117_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-021-00537-0","author":"Y Niu","year":"2021","unstructured":"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.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"7","key":"1117_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.: 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":"1117_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"},{"issue":"2","key":"1117_CR27","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s12095-020-00463-x","volume":"13","author":"H Zhang","year":"2021","unstructured":"Zhang H., Cao X.: Further constructions of cyclic subspace codes. Cryptogr. Commun. 13(2), 245\u2013262 (2021).","journal-title":"Cryptogr. Commun."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01117-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01117-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01117-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:50:52Z","timestamp":1676015452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01117-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,3]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1117"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01117-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,3]]},"assertion":[{"value":"18 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}