{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:54:13Z","timestamp":1771476853476,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T00:00:00Z","timestamp":1525824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11431003"],"award-info":[{"award-number":["11431003"]}],"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":["61571310"],"award-info":[{"award-number":["61571310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Scholars Program"},{"name":"Beijing Hundreds of Leading Talents Training Project of Science and Technology"},{"DOI":"10.13039\/501100005089","name":"Beijing Municipal Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005089","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":[[2019,1]]},"DOI":"10.1007\/s10623-018-0491-4","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T22:35:31Z","timestamp":1525818931000},"page":"107-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Constructions of optimal Ferrers diagram rank metric codes"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9914-0382","authenticated-orcid":false,"given":"Tao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,9]]},"reference":[{"issue":"2","key":"491_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.3934\/amc.2013.7.127","volume":"7","author":"C Bachoc","year":"2013","unstructured":"Bachoc C., Passuello A., Vallentin F.: Bounds for projective codes from semidefinite programming. Adv. Math. Commun. 7(2), 127\u2013145 (2013).","journal-title":"Adv. Math. Commun."},{"issue":"3","key":"491_CR2","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 Ser. A 25(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"491_CR3","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(4), 1616\u20131630 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"491_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":"491_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":"2","key":"491_CR6","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":"491_CR7","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985).","journal-title":"Problemy Peredachi Informatsii"},{"issue":"7","key":"491_CR8","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(7), 3207\u20133216 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"491_CR9","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter 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":"491_CR10","unstructured":"Kohnert A., Kurz S.: Construction of large constant dimension codes with a prescribed minimum distance. In: Mathematical Methods in Computer Science. Lecture Notes in Computer Science, vol 5393, pp. 31\u201342. Springer, Berlin (2008)."},{"issue":"1","key":"491_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TIT.2010.2090252","volume":"57","author":"N Silberstein","year":"2011","unstructured":"Silberstein N., Etzion T.: Enumerative coding for Grassmannian space. IEEE Trans. Inf. Theory 57(1), 365\u2013374 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"491_CR12","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(2), 177\u2013189 (2011).","journal-title":"Adv. Math. Commun."},{"issue":"7","key":"491_CR13","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(7), 3937\u20133953 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"491_CR14","doi-asserted-by":"crossref","unstructured":"Silberstein N., Trautmann A.-L.: New lower bounds for constant dimension codes. In: Proceedings of the IEEE International Symposium on Information Theory, pp. 514\u2013518 (2013).","DOI":"10.1109\/ISIT.2013.6620279"},{"issue":"12","key":"491_CR15","doi-asserted-by":"publisher","first-page":"5479","DOI":"10.1109\/TIT.2009.2032817","volume":"55","author":"D Silva","year":"2009","unstructured":"Silva D., Kschischang F.R.: On metrics for error correction in network coding. IEEE Trans. Inf. Theory 55(12), 5479\u20135490 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"491_CR16","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(9), 3951\u20133967 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"491_CR17","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/TIT.2009.2039163","volume":"56","author":"V Skachek","year":"2010","unstructured":"Skachek V.: Recursive code construction for random networks. IEEE Trans. Inf. Theory 56(3), 1378\u20131382 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"491_CR18","unstructured":"Trautmann A.-L., Rosenthal J.: New improvements on the Echelon-Ferrers construction. In: Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems, pp. 405\u2013408 (2010)."},{"issue":"2","key":"491_CR19","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."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0491-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0491-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0491-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T19:18:16Z","timestamp":1557343096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0491-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["491"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0491-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,9]]},"assertion":[{"value":"6 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}