{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:48:47Z","timestamp":1764175727999,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:00:00Z","timestamp":1725580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:00:00Z","timestamp":1725580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007515","name":"Universidad de Valladolid","doi-asserted-by":"crossref","award":["E-47-2022-0001486"],"award-info":[{"award-number":["E-47-2022-0001486"]}],"id":[{"id":"10.13039\/501100007515","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["TED2021-130358B-I00","PID2022-138906NB-C21"],"award-info":[{"award-number":["TED2021-130358B-I00","PID2022-138906NB-C21"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this work, we provide four methods for constructing new maximum sum-rank distance (MSRD) codes. The first method, a variant of cartesian products, allows faster decoding than known MSRD codes of the same parameters. The other three methods allow us to extend or modify existing MSRD codes in order to obtain new explicit MSRD codes for sets of matrix sizes (numbers of rows and columns in different blocks) that were not attainable by previous constructions. In this way, we show that MSRD codes exist (by giving explicit constructions) for new ranges of parameters, in particular with different numbers of rows and columns at different positions.<\/jats:p>","DOI":"10.1007\/s40314-024-02915-z","type":"journal-article","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:03:14Z","timestamp":1725634994000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New constructions of MSRD codes"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2626-8139","authenticated-orcid":false,"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,6]]},"reference":[{"issue":"10","key":"2915_CR1","doi-asserted-by":"publisher","first-page":"6456","DOI":"10.1109\/TIT.2021.3074190","volume":"67","author":"E Byrne","year":"2021","unstructured":"Byrne E, Gluesing-Luerssen H, Ravagnani A (2021) Fundamental properties of sum-rank-metric codes. IEEE Trans Info Theory 67(10):6456\u20136475","journal-title":"IEEE Trans Info Theory"},{"issue":"1","key":"2915_CR2","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TIT.2021.3120016","volume":"68","author":"H Cai","year":"2022","unstructured":"Cai H, Miao Y, Schwartz M, Tang X (2022) A construction of maximally recoverable codes with order-optimal field size. IEEE Trans Info Theory 68(1):204\u2013212","journal-title":"IEEE Trans Info Theory"},{"issue":"10","key":"2915_CR3","doi-asserted-by":"publisher","first-page":"6303","DOI":"10.1109\/TIT.2023.3292162","volume":"69","author":"H Chen","year":"2023","unstructured":"Chen H (2023) New explicit good linear sum-rank-metric codes. IEEE Trans Info Theory 69(10):6303\u20136313","journal-title":"IEEE Trans Info Theory"},{"issue":"1","key":"2915_CR4","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin EM (1985) Theory of codes with maximum rank distance. Prob Info Transm 21(1):1\u201312","journal-title":"Prob Info Transm"},{"issue":"11","key":"2915_CR5","doi-asserted-by":"publisher","first-page":"7198","DOI":"10.1109\/TIT.2022.3176807","volume":"68","author":"S Gopi","year":"2022","unstructured":"Gopi S, Guruswami V (2022) Improved maximally recoverable LRCs using skew polynomials. IEEE Trans Info Theory 68(11):7198\u20137214","journal-title":"IEEE Trans Info Theory"},{"unstructured":"Gorla E, Mart\u00ednez-Pe\u00f1as U, Salizzoni F (2023) Sum-rank metric codes. Preprint: arXiv:2304.12095","key":"2915_CR6"},{"issue":"5","key":"2915_CR7","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1109\/TIT.2005.846403","volume":"51","author":"H-F Lu","year":"2005","unstructured":"Lu H-F, Kumar PV (2005) A unified construction of space-time codes with optimal rate-diversity tradeoff. IEEE Trans Info Theory 51(5):1709\u20131730","journal-title":"IEEE Trans Info Theory"},{"key":"2915_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.jalgebra.2018.02.005","volume":"504","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as U (2018) Skew and linearized Reed\u2013Solomon codes and maximum sum rank distance codes over any division ring. J Algebra 504:587\u2013612","journal-title":"J Algebra"},{"key":"2915_CR9","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1007\/s10623-019-00619-8","volume":"87","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as U (2019) Theory of supports for linear codes endowed with the sum-rank metric. Des Codes Crypto 87:2295\u20132320","journal-title":"Des Codes Crypto"},{"issue":"3","key":"2915_CR10","doi-asserted-by":"publisher","first-page":"1868","DOI":"10.1137\/20M1386001","volume":"36","author":"U Mart\u00ednez-Pe\u00f1as","year":"2022","unstructured":"Mart\u00ednez-Pe\u00f1as U (2022) A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices. SIAM J Disc Math 36(3):1868\u20131886","journal-title":"SIAM J Disc Math"},{"unstructured":"Mart\u00ednez-Pe\u00f1as U (2022) Multilayer crisscross error and erasure correction. Preprint: arXiv:2203.07238","key":"2915_CR11"},{"key":"2915_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102272","volume":"91","author":"U Mart\u00ednez-Pe\u00f1as","year":"2023","unstructured":"Mart\u00ednez-Pe\u00f1as U (2023) Doubly and triply extended MSRD codes. Finite Fields App 91:102272","journal-title":"Finite Fields App"},{"issue":"12","key":"2915_CR13","doi-asserted-by":"publisher","first-page":"7790","DOI":"10.1109\/TIT.2019.2924888","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as U, Kschischang FR (2019) Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes. IEEE Trans Info Theory 65(12):7790\u20137805","journal-title":"IEEE Trans Info Theory"},{"issue":"8","key":"2915_CR14","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1109\/TIT.2019.2912165","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as U, Kschischang FR (2019) Reliable and secure multishot network coding using linearized Reed\u2013Solomon codes. IEEE Trans Info Theory 65(8):4785\u20134803","journal-title":"IEEE Trans Info Theory"},{"issue":"5","key":"2915_CR15","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1561\/0100000120","volume":"19","author":"U Mart\u00ednez-Pe\u00f1as","year":"2022","unstructured":"Mart\u00ednez-Pe\u00f1as U, Shehadeh M, Kschischang FR (2022) Codes in the sum-rank metric, fundamentals and applications. Found Trends Commun Inform Theory 19(5):814\u20131031","journal-title":"Found Trends Commun Inform Theory"},{"key":"2915_CR16","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1016\/j.jalgebra.2022.06.027","volume":"609","author":"A Neri","year":"2022","unstructured":"Neri A (2022) Twisted linearized Reed\u2013Solomon codes: a skew polynomial framework. J Algebra 609:792\u2013839","journal-title":"J Algebra"},{"key":"2915_CR17","doi-asserted-by":"publisher","first-page":"105703","DOI":"10.1016\/j.jcta.2022.105703","volume":"194","author":"A Neri","year":"2023","unstructured":"Neri A, Santonastaso P, Zullo F (2023) The geometry of one-weight codes in the sum-rank metric. J Combin Theory S A 194:105703","journal-title":"J Combin Theory S A"},{"doi-asserted-by":"crossref","unstructured":"N\u00f3brega RW, Uch\u00f4a-Filho BF (2010) Multishot codes for network coding using rank-metric codes. In: Proc. Third IEEE Int. Workshop Wireless Network Coding, pages 1\u20136","key":"2915_CR18","DOI":"10.1109\/WINC.2010.5507933"},{"unstructured":"Santonastaso P, Sheekey J (2023) On MSRD codes, h-designs and disjoint maximum scattered linear sets. arXiv:2308.00378","key":"2915_CR19"},{"issue":"1","key":"2915_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4171\/emss\/77","volume":"11","author":"P Santonastaso","year":"2023","unstructured":"Santonastaso P, Zullo F (2023) On subspace designs. EMS Surv Math Sci 11(1):1\u201362","journal-title":"EMS Surv Math Sci"},{"doi-asserted-by":"crossref","unstructured":"Shehadeh M, Kschischang FR (2022) Space-time codes from sum-rank codes. IEEE Trans Info Theory 68(3):1614\u20131637","key":"2915_CR21","DOI":"10.1109\/TIT.2021.3129767"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02915-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02915-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02915-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T05:36:54Z","timestamp":1727156214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02915-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,6]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2915"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02915-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,9,6]]},"assertion":[{"value":"13 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"398"}}