{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T14:14:46Z","timestamp":1785161686190,"version":"3.55.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.disc.2026.115236","type":"journal-article","created":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T07:18:44Z","timestamp":1780039124000},"page":"115236","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["New constant dimension subspace codes by multilevel and parallel linkage constructions"],"prefix":"10.1016","volume":"349","author":[{"given":"Sheo Kumar","family":"Singh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramesh","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115236_br0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2024.105908","article-title":"Maximum flag-rank distance codes","volume":"207","author":"Alfarano","year":"2024","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"9","key":"10.1016\/j.disc.2026.115236_br0020","doi-asserted-by":"crossref","first-page":"5317","DOI":"10.1109\/TIT.2020.2975776","article-title":"New constructions of subspace codes using subsets of MRD codes in several blocks","volume":"66","author":"Chen","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0030","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","article-title":"Bilinear forms over a finite field, with applications to coding theory","volume":"25","author":"Delsarte","year":"1978","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2026.115236_br0040","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1109\/TIT.2016.2522971","article-title":"Optimal Ferrers diagram rank-metric codes","volume":"62","author":"Etzion","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0050","doi-asserted-by":"crossref","first-page":"2909","DOI":"10.1109\/TIT.2009.2021376","article-title":"Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams","volume":"55","author":"Etzion","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0060","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1109\/TIT.2012.2220119","article-title":"Codes and designs related to lifted MRD codes","volume":"59","author":"Etzion","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0070","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/TIT.2010.2095232","article-title":"Error-correcting codes in projective space","volume":"57","author":"Etzion","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0080","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Probl. Pereda. Inf."},{"key":"10.1016\/j.disc.2026.115236_br0090","doi-asserted-by":"crossref","first-page":"525","DOI":"10.3934\/amc.2016023","article-title":"Construction of subspace codes through linkage","volume":"10","author":"Gluesing-Luerssen","year":"2016","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.disc.2026.115236_br0100","doi-asserted-by":"crossref","first-page":"1422","DOI":"10.1109\/LCOMM.2021.3052734","article-title":"New construction for constant dimension subspace codes via a composite structure","volume":"25","author":"He","year":"2021","journal-title":"IEEE Commun. Lett."},{"key":"10.1016\/j.disc.2026.115236_br0110","doi-asserted-by":"crossref","first-page":"2991","DOI":"10.1007\/s10623-022-01065-9","article-title":"Parallel sub-code construction for constant-dimension codes","volume":"90","author":"He","year":"2022","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.disc.2026.115236_br0120","author":"Heinlein"},{"key":"10.1016\/j.disc.2026.115236_br0130","series-title":"Fundamentals of Error-Correcting Codes","author":"Huffman","year":"2010"},{"key":"10.1016\/j.disc.2026.115236_br0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2025.102750","article-title":"Cardinality-consistent flag codes with larger cardinality","volume":"110","author":"Jia","year":"2026","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.disc.2026.115236_br0150","doi-asserted-by":"crossref","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","article-title":"Coding for errors and erasures in random network coding","volume":"54","author":"K\u00f6tter","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0160","author":"Kurz"},{"issue":"4","key":"10.1016\/j.disc.2026.115236_br0170","doi-asserted-by":"crossref","first-page":"956","DOI":"10.3934\/amc.2022039","article-title":"New constant dimension subspace codes from multilevel linkage construction","volume":"18","author":"Lao","year":"2024","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.disc.2026.115236_br0180","author":"Lao"},{"key":"10.1016\/j.disc.2026.115236_br0190","doi-asserted-by":"crossref","first-page":"2760","DOI":"10.1109\/TIT.2019.2960343","article-title":"Construction of constant dimension subspace codes by modifying linkage construction","volume":"66","author":"Li","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.disc.2026.115236_br0200","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1109\/TIT.2025.3645311","article-title":"New constant dimension codes from the inserting mixed dimension construction and multilevel construction","volume":"72","author":"Li","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0210","doi-asserted-by":"crossref","first-page":"6884","DOI":"10.1109\/TIT.2020.3004315","article-title":"Parallel multilevel constructions for constant dimension codes","volume":"66","author":"Liu","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0220","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s12095-021-00504-z","article-title":"New constant dimension subspace codes from parallel linkage construction and multilevel construction","volume":"14","author":"Niu","year":"2021","journal-title":"Cryptogr. Commun."},{"key":"10.1016\/j.disc.2026.115236_br0230","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10623-008-9221-7","article-title":"Johnson type bounds on constant dimension codes","volume":"50","author":"Xia","year":"2009","journal-title":"Des. Codes Cryptogr."},{"issue":"10","key":"10.1016\/j.disc.2026.115236_br0240","doi-asserted-by":"crossref","first-page":"7959","DOI":"10.1109\/TIT.2025.3596103","article-title":"Coset constructions of constant dimension codes by cosets of optimal Ferrers diagrams rank metric codes","volume":"71","author":"Xu","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115236_br0250","doi-asserted-by":"crossref","first-page":"6315","DOI":"10.1109\/TIT.2018.2839596","article-title":"New constant-dimension subspace codes from maximum rank distance codes","volume":"64","author":"Xu","year":"2018","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002608?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002608?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T13:35:09Z","timestamp":1785159309000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26002608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":25,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2026,11]]}},"alternative-id":["S0012365X26002608"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115236","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New constant dimension subspace codes by multilevel and parallel linkage constructions","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115236","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115236"}}