{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:33:52Z","timestamp":1775093632148,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"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":["No. 61772015"],"award-info":[{"award-number":["No. 61772015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Postgraduate Research & Practice Innovation Program of Jiangsu Province","award":["No. KYCX20-0226"],"award-info":[{"award-number":["No. KYCX20-0226"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12095-021-00504-z","type":"journal-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T18:03:16Z","timestamp":1624903396000},"page":"201-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["New constant dimension subspace codes from parallel linkage construction and multilevel construction"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0797-2104","authenticated-orcid":false,"given":"Yongfeng","family":"Niu","sequence":"first","affiliation":[]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Daitao","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,28]]},"reference":[{"issue":"10","key":"504_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. Inform. Theory 65(10), 6204\u20136223 (2019)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"504_CR2","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1109\/TIT.2016.2520479","volume":"62","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Etzion, T., Gabizon, A., Raviv, N.: Subspace polynomials and cyclic subspace codes. IEEE Trans. Inf. Theory 62(3), 1157\u20131165 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"504_CR3","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1007\/s10623-017-0394-9","volume":"86","author":"B Chen","year":"2017","unstructured":"Chen, B., Liu, H.: Constructions of cyclic constant dimension codes. Des. Codes Cryptogr. 86(6), 1267\u20131279 (2017)","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"504_CR4","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., et al.: 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":"504_CR5","unstructured":"de la Cruz, J., Gorla, E., Lopez, H.H., Ravagnani, A.: Rank distribution of Delsarte code. arXiv:1510.01008v1 (2019)"},{"issue":"3","key":"504_CR6","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 Ser. A 25(3), 226\u2013241 (1978)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"504_CR7","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., Alberto, A.: Wachter, Optimal Ferrers diagram rank-metric codes. IEEE Trans. Inform. Theory 62(4), 1616\u20131630 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"504_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":"2","key":"504_CR9","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":"2","key":"504_CR10","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 space. IEEE Trans. Inf. Theory 57(2), 1165\u20131173 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"504_CR11","first-page":"3","volume":"21","author":"\u00c8M Gabidulin","year":"1985","unstructured":"Gabidulin, \u00c8. M.: Theory of codes with maximum rank distance. Problem Inf. Transmiss 21(1), 3\u201316 (1985)","journal-title":"Problem Inf. Transmiss"},{"issue":"3","key":"504_CR12","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."},{"key":"504_CR13","doi-asserted-by":"crossref","unstructured":"Heinlein, D., Kurz, S.: Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound. [Online] arXiv:1705.03835 (2017)","DOI":"10.1007\/978-3-319-66278-7_15"},{"issue":"12","key":"504_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. Inform. Theory 63(12), 7651\u20137660 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"504_CR15","unstructured":"Heinlein, D., Kiermaier, M., Kurz, S., Wassermann, A.: Tables of subspace codes. [Online] Available: arXiv:1601.02864v3 (2019)"},{"issue":"8","key":"504_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":"504_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-89994-5_4","volume":"5393","author":"A Kohnert","year":"2008","unstructured":"Kohnert, A., Kurz, S.: Construction of large constant dimension codes with a prescribed minimum distance. Math. Methods. Comput. Sci. 5393, 31\u201342 (2008)","journal-title":"Math. Methods. Comput. Sci."},{"issue":"5","key":"504_CR18","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)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"504_CR19","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. Inform. Theory 65(7), 4115\u20134130 (2019)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"504_CR20","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."},{"issue":"11","key":"504_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"},{"key":"504_CR22","doi-asserted-by":"crossref","unstructured":"Niu, Y., Yue, Q., Wu, Y.: Several kinds of large cyclic subspace codes via Sidon spaces, vol. 343 (2020)","DOI":"10.1016\/j.disc.2019.111788"},{"issue":"2","key":"504_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10623-016-0297-1","volume":"85","author":"K Otal","year":"2017","unstructured":"Otal, K., \u00d6zbudak, F.: Cyclic subspace codes via subspace polynomials. Des. Codes Cryptogr. 85(2), 191\u2013204 (2017)","journal-title":"Des. Codes Cryptogr."},{"key":"504_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2019.01.002","volume":"57","author":"W Zhao","year":"2019","unstructured":"Zhao, W., Tang, X.: A characterization of cyclic subspace codes via subspace polynomials. Finite Fields Their Appl. 57, 1\u201312 (2019)","journal-title":"Finite Fields Their Appl."},{"key":"504_CR25","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"},{"issue":"2","key":"504_CR26","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-008-9221-7","volume":"50","author":"S-T Xia","year":"2009","unstructured":"Xia, S.-T., Fu, F.-W.: Johnson type bounds on constant dimension codes. Des. Codes Cryptogr. 50(2), 163\u2013172 (2009)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"504_CR27","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(1), 107\u2013121 (2019)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00504-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00504-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00504-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T07:15:01Z","timestamp":1646291701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00504-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["504"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00504-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,28]]},"assertion":[{"value":"25 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}