{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:45:17Z","timestamp":1761972317661,"version":"build-2065373602"},"reference-count":25,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,11,1]]},"DOI":"10.1587\/transfun.2025eal2015","type":"journal-article","created":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T18:10:52Z","timestamp":1747764652000},"page":"1561-1565","source":"Crossref","is-referenced-by-count":0,"title":["Combining Parallel Linkage Construction and Echelon-Ferrers Construction for Constant-Dimension Codes"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Xueyuan","family":"ZHANG","sequence":"first","affiliation":[{"name":"Ningbo University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"SHAOYU","sequence":"additional","affiliation":[{"name":"Ningbo University of Finance and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianmang","family":"HE","sequence":"additional","affiliation":[{"name":"Ningbo University of Finance and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujia","family":"LI","sequence":"additional","affiliation":[{"name":"Shanghai Dianji University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] R. Koetter and F.R. Kschischang, \u201cCoding for errors and erasures in random network coding,\u201d IEEE Trans. Inf. Theory, vol.54, no.8, pp.3579-3591, 2008. 10.1109\/tit.2008.926449","DOI":"10.1109\/TIT.2008.926449"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] A. Cossidente, S. Kurz, G. Marino, and F. Pavese, \u201cCombining subspace codes,\u201d Advances in Mathematics of Communications, vol.17, no.3, pp.536-550, 2023. 10.3934\/amc.2021007","DOI":"10.3934\/amc.2021007"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] A. Cossidente and F. Pavese, \u201cSubspace codes in pg(2<i>n<\/i> -1, <i>q<\/i>),\u201d Combinatorica, vol.37, no.6, pp.1073-1095, 2017. 10.1007\/s00493-016-3354-5","DOI":"10.1007\/s00493-016-3354-5"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] H. Chen, X. He, J. Weng, and L. Xu, \u201cNew constructions of subspace codes using subsets of MRD codes in several blocks,\u201d IEEE Trans. Inf. Theory, vol.66, no.9, pp.5317-5321, 2020. 10.1109\/tit.2020.2975776","DOI":"10.1109\/TIT.2020.2975776"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] T. Etzion and N. Silberstein, \u201cCodes and designs related to lifted MRD codes,\u201d IEEE Trans. Inf. Theory, vol.59, no.2, pp.1004-1017, 2013. 10.1109\/tit.2012.2220119","DOI":"10.1109\/TIT.2012.2220119"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] T. Etzion and N. Silberstein, \u201cError-correcting codes in projective spaces via rank-metric codes and ferrers diagrams,\u201d IEEE Trans. Inf. Theory, vol.55, no.7, pp.2909-2919, 2009. 10.1109\/tit.2009.2021376","DOI":"10.1109\/TIT.2009.2021376"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] L. Xu and H. Chen, \u201cNew constant-dimension subspace codes from maximum rank-distance codes,\u201d IEEE Trans. Inf. Theory, vol.64, no.9, pp.6315-6319, 2018. 10.1109\/tit.2018.2839596","DOI":"10.1109\/TIT.2018.2839596"},{"key":"8","unstructured":"[8] D. Heinlein, M. Kiermaier, S. Kurz, and A. Wassermann, \u201cTables of subspace codes,\u201d arxiv preprint arXiv:1601.02864, 2016. 10.48550\/arXiv.1601.02864"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] H. Gluesing-Luerssen and C. Troha, \u201cConstruction of subspace codes through linkage,\u201d Advances in Mathematics of Communications, vol.10, no.3, pp.525-540, 2016. 10.3934\/amc.2016023","DOI":"10.3934\/amc.2016023"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D. Heinlein and S. Kurz, \u201cAsymptotic bounds for the sizes of constant dimension codes and an improved lower bound,\u201d Coding Theory and Applications, vol.10495, pp.163-191, 2017. 10.1007\/978-3-319-66278-7_15","DOI":"10.1007\/978-3-319-66278-7_15"},{"key":"11","unstructured":"[11] H. Lao, H. Chen, J. Weng, and X. Tan, \u201cParameter-controlled inserting constructions of constant dimension subspace codes,\u201d ArXiv, vol.abs\/2008.09944, 2020. 10.48550\/arXiv.2008.09944"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] X. He, Y. Chen, and Z. Zhang, \u201cImproving the linkage construction with echelon-ferrers for constant-dimension codes,\u201d IEEE Commun. Lett., vol.24, no.9, pp.1875-1879, 2020. 10.1109\/lcomm.2020.2997928","DOI":"10.1109\/LCOMM.2020.2997928"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] D. Heinlein, \u201cGeneralized linkage construction for constant-dimension codes,\u201d IEEE Trans. Inf. Theory, vol.67, no.2, pp.705-715, 2021. 10.1109\/tit.2020.3038272","DOI":"10.1109\/TIT.2020.3038272"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] X. He, \u201cConstruction of constant dimension codes from two parallel versions of linkage construction,\u201d IEEE Commun. Lett., vol.24, no.11, pp.2392-2395, 2020. 10.1109\/lcomm.2020.3012488","DOI":"10.1109\/LCOMM.2020.3012488"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] S. Liu and L. Ji, \u201cDouble multilevel constructions for constant dimension codes,\u201d IEEE Trans. Inf. Theory, vol.69, no.1, pp.157-168, 2023. 10.1109\/tit.2022.3200052","DOI":"10.1109\/TIT.2022.3200052"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] S. Liu, Y. Chang, and T. Feng, \u201cParallel multilevel constructions for constant dimension codes,\u201d IEEE Trans. Inf. Theory, vol.66, no.11, pp.6884-6897, 2020. 10.1109\/tit.2020.3004315","DOI":"10.1109\/TIT.2020.3004315"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] S. Yu, L. Ji, and S. Liu, \u201cBilateral multilevel construction of constant dimension codes,\u201d Advances in Mathematics of Communications, vol.16, no.4, pp.1165-1183, 2022. 10.3934\/amc.2022056","DOI":"10.3934\/amc.2022056"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] H. Lao, H. Chen, F. Li, and S. Lyu, \u201cNew constant dimension subspace codes from the mixed dimension construction,\u201d IEEE Trans. Inf. Theory, vol.69, pp.4333-4344, 2023. 10.1109\/tit.2023.3255929","DOI":"10.1109\/TIT.2023.3255929"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] X. He, Z. Zhang, S. Tian, J. Wang, and Y. Chen, \u201cParallel construction for constant dimension codes from mixed dimension construction,\u201d Des. Codes Cryptogr., vol.93, pp.227-241, 2024. 10.1007\/s10623-024-01518-3","DOI":"10.1007\/s10623-024-01518-3"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] P. Delsarte, \u201cBilinear forms over a finite field, with applications to coding theory,\u201d Journal of Combinatorial Theory, Series A, vol.25, no.3, pp.226-241, 1978. 10.1016\/0097-3165(78)90015-8","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] J. de la Cruz, E. Gorla, H.H. L\u00f3pez, and A. Ravagnani, \u201cWeight distribution of rank-metric codes,\u201d Des. Codes Cryptogr., vol.86, pp.1-16, 2015. 10.1007\/s10623-016-0325-1","DOI":"10.1007\/s10623-016-0325-1"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[14] X. He, \u201cConstruction of constant dimension codes from two parallel versions of linkage construction,\u201d IEEE Commun. Lett., vol.24, no.11, pp.2392-2395, 2020. 10.1109\/lcomm.2020.3012488","DOI":"10.1109\/LCOMM.2020.3012488"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] F. Li, \u201cConstruction of constant dimension subspace codes by modifying linkage construction,\u201d IEEE Trans. Inf. Theory, vol.66, no.5, pp.2760-2764, 2020. 10.1109\/tit.2019.2960343","DOI":"10.1109\/TIT.2019.2960343"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] H. Lao and H. Chen, \u201cNew constant dimension subspace codes from multilevel linkage construction,\u201d Advances in Mathematics of Communications, vol.18, no.4, pp.956-966, 2024. 10.3934\/amc.2022039","DOI":"10.3934\/amc.2022039"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] D. Heinlein and S. Kurz, \u201cAsymptotic bounds for the sizes of constant dimension codes and an improved lower bound,\u201d Coding Theory and Applications, ICMCTA 2017, pp.163-191, 2017. 10.1007\/978-3-319-66278-7_15","DOI":"10.1007\/978-3-319-66278-7_15"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/11\/E108.A_2025EAL2015\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T03:39:20Z","timestamp":1761968360000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/11\/E108.A_2025EAL2015\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,1]]},"references-count":25,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1587\/transfun.2025eal2015","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,11,1]]},"article-number":"2025EAL2015"}}