{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T17:31:42Z","timestamp":1787160702520,"version":"build-2736575974"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T00:00:00Z","timestamp":1692403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T00:00:00Z","timestamp":1692403200000},"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":["12101440"],"award-info":[{"award-number":["12101440"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20210858"],"award-info":[{"award-number":["BK20210858"]}],"id":[{"id":"10.13039\/501100004608","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,12]]},"DOI":"10.1007\/s10623-023-01284-8","type":"journal-article","created":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T11:05:13Z","timestamp":1692443113000},"page":"3977-3993","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Ferrers diagram rank-metric codes from MRD codes"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1864-1717","authenticated-orcid":false,"given":"Shuangqing","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,19]]},"reference":[{"key":"1284_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R., Cai N., Li S.-Y.R., Yeung R.W.: Network information flow. IEEE Trans. Inf. Theory 46, 1204\u20131216 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1284_CR2","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":"1284_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.laa.2015.05.028","volume":"483","author":"E Ballico","year":"2015","unstructured":"Ballico E.: Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank. Linear Algebra Appl. 483, 30\u201339 (2015).","journal-title":"Linear Algebra Appl."},{"key":"1284_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., 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":"1284_CR5","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2021007","author":"A Cossidente","year":"2019","unstructured":"Cossidente A., Kurz S., Marino G., Pavese F.: Combining subspace codes. Adv. Math. Commun. (2019). https:\/\/doi.org\/10.3934\/amc.2021007.","journal-title":"Adv. Math. Commun."},{"key":"1284_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. Comb. Theory A 25, 226\u2013241 (1978).","journal-title":"J. Comb. Theory A"},{"key":"1284_CR7","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":"1284_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":"1284_CR9","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":"1284_CR10","unstructured":"Feng, T., Kruz, S., Liu, S.: Bounds for the multilevel construction. arXiv:2011.06937."},{"key":"1284_CR11","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":"1284_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, 525\u2013540 (2016).","journal-title":"Adv. Math. Commun."},{"key":"1284_CR13","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":"1284_CR14","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":"1284_CR15","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":"1284_CR16","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":"1284_CR17","unstructured":"Heinlein D., Kiermaier M., Kurz S., Wassermann A.: Tables of subspace codes. http:\/\/subspacecodes.uni-bayreuth.de."},{"key":"1284_CR18","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":"1284_CR19","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":"1284_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113477","volume":"346","author":"S Liu","year":"2023","unstructured":"Liu S., Ji L.: Constant dimension codes from multilevel construction based on matchings of complete hypergraphs. Discret. Math. 346, 113477 (2023).","journal-title":"Discret. Math."},{"key":"1284_CR21","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":"1284_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":"1284_CR23","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":"1284_CR24","unstructured":"Neri A., Stanojkovski M.: A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams. arXiv:2306.16407."},{"key":"1284_CR25","unstructured":"Pai S.B., Rajan B.S.: A Singleton bound for generalized Ferrers diagram rank metric codes. arXiv:1506.05558v1."},{"key":"1284_CR26","unstructured":"Pratihar R., Randrianarisoa T.H.: Constructions of optimal rank-metric codes from automorphisms of rational function fields. arXiv:1907.05508v4."},{"key":"1284_CR27","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":"1284_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":"1284_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":"1284_CR30","unstructured":"Trautmann A.-L., Rosenthal J.: New improvements on the Echelon-Ferrers construction. In: Proceedings of 19th International Symposium Mathematical Theory Network System, pp. 405\u2013408 (2010)."},{"key":"1284_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":"1284_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":"1284_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-023-01284-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01284-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01284-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T08:05:45Z","timestamp":1699085145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01284-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,19]]},"references-count":33,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1284"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01284-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,19]]},"assertion":[{"value":"2 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}