{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:39Z","timestamp":1771611039343,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18- CE40-0026-01 (CLap-CLap)"],"award-info":[{"award-number":["ANR-18- CE40-0026-01 (CLap-CLap)"]}],"id":[{"id":"10.13039\/501100001665","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,1]]},"DOI":"10.1007\/s10623-022-01102-7","type":"journal-article","created":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T07:04:07Z","timestamp":1662534247000},"page":"241-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Duals of linearized Reed\u2013Solomon codes"],"prefix":"10.1007","volume":"91","author":[{"given":"Xavier","family":"Caruso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Durand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"issue":"111","key":"1102_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.2298\/PIM131217001A","volume":"97","author":"W Arriagada","year":"2015","unstructured":"Arriagada W., Ram\u00edrez H.: Centers of skew polynomial rings. Publ. Inst. Math. 97(111), 181\u2013186 (2015).","journal-title":"Publ. Inst. Math."},{"key":"1102_CR2","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1007\/s10623-017-0425-6","volume":"86","author":"D Augot","year":"2018","unstructured":"Augot D., Loidreau P., Robert G.: Generalized Gabidulin codes over fields of any characteristic. Des. Codes Cryptogr. 86, 1807\u20131848 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"1102_CR3","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.jalgebra.2017.11.045","volume":"498","author":"M Bre\u0161ar","year":"2018","unstructured":"Bre\u0161ar M., Hanselka C., Klep I., Vol\u010di\u010d J.: Skolem-Noether algebras. J. Algebra 498, 294\u2013314 (2018).","journal-title":"J. Algebra"},{"key":"1102_CR4","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1016\/j.jsc.2007.11.008","volume":"44","author":"D Boucher","year":"2009","unstructured":"Boucher D., Ulmer F.: Coding with skew polynomial rings. J. Symbolic Comput. 44, 1644\u20131656 (2009).","journal-title":"J. Symbolic Comput."},{"key":"1102_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10623-012-9704-4","volume":"70","author":"D Boucher","year":"2014","unstructured":"Boucher D., Ulmer F.: Linear codes using skew polynomials with automorphisms and derivations. Des. Codes Cryptogr. 70, 405\u2013431 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1102_CR6","unstructured":"Byrne E., Gluesing-Luerssen H., Ravagnani A.: Fundamental properties of sum-rank metric codes. IEEE Trans. Inf. Theory, to appear."},{"key":"1102_CR7","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.5802\/jep.169","volume":"8","author":"X Caruso","year":"2021","unstructured":"Caruso X.: A theory of residues for skew rational functions. J. \u00c9c. Polytech. 8, 1159\u20131192 (2021).","journal-title":"J. \u00c9c. Polytech."},{"key":"1102_CR8","volume-title":"Free Rings and Their Relations. London Math. Soc. Monographs","author":"PM Cohn","year":"1971","unstructured":"Cohn P.M.: Free Rings and Their Relations. London Math. Soc. Monographs. Academic Press, New York (1971)."},{"key":"1102_CR9","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 25, 226\u2013241 (1978).","journal-title":"J. Comb. Theory"},{"issue":"1","key":"1102_CR10","first-page":"3","volume":"21","author":"E Gabidulin","year":"1985","unstructured":"Gabidulin E.: Theory of codes with maximum rank distance. Probl. Peredachi Inf. 21(1), 3\u201316 (1985).","journal-title":"Probl. Peredachi Inf."},{"key":"1102_CR11","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1090\/S0002-9947-1937-1501922-7","volume":"42","author":"N Jacobson","year":"1937","unstructured":"Jacobson N.: Abstract derivation and Lie algebras. Trans. Am. Math. Soc. 42, 206\u2013224 (1937).","journal-title":"Trans. Am. Math. Soc."},{"key":"1102_CR12","doi-asserted-by":"publisher","first-page":"484","DOI":"10.2307\/1968565","volume":"38","author":"N Jacobson","year":"1937","unstructured":"Jacobson N.: Pseudo-linear transformations. Ann. Math. 38, 484\u2013507 (1937).","journal-title":"Ann. Math."},{"key":"1102_CR13","doi-asserted-by":"crossref","unstructured":"Jacobson N.: Finite-Dimensional Division Algebras Over Fields, Grundlehren der Mathematischen Wissenschaften Series. Springer, New York (1996).","DOI":"10.1007\/978-3-642-02429-0"},{"key":"1102_CR14","first-page":"193","volume":"4","author":"TY Lam","year":"1986","unstructured":"Lam T.Y.: A general theory of Vandermonde matrices. Expositiones Math. 4, 193\u2013215 (1986).","journal-title":"Expositiones Math."},{"key":"1102_CR15","first-page":"321","volume":"2","author":"A Leroy","year":"1995","unstructured":"Leroy A.: Pseudo linear transformations and evaluation in Ore extensions. Bull. Soc. Math. Belg. 2, 321\u2013347 (1995).","journal-title":"Bull. Soc. Math. Belg."},{"key":"1102_CR16","unstructured":"Liu S.: Generalized skew Reed-Solomon codes and other applications of skew polynomial evaluation, PhD thesis. https:\/\/tspace.library.utoronto.ca\/bitstream\/1807\/73073\/1\/Liu_Siyu_201606_PhD_thesis.pdf (2016)."},{"key":"1102_CR17","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 P.: A unified construction of space-time codes with optimal rate-diversity tradeoff. IEEE Trans. Inf. Theory 51, 1709\u20131730 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1102_CR18","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.: Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring. J. Algebra 504, 587\u2013612 (2018).","journal-title":"J. Algebra"},{"key":"1102_CR19","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 F.: Reliable and secure Multishot network coding using linearized Reed-Solomon codes. IEEE Trans. Inf. Theory 65, 4785\u20134803 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1102_CR20","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.: Theory of supports for linear codes endowed with the sum-rank metric. Des. Codes Cryptogr. 87, 2295\u20132320 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1102_CR21","doi-asserted-by":"crossref","unstructured":"Ott C., Puchinger S., Bossert M.: Bounds and genericity of sum-rank-metric codes, preprint (2021). arXiv:2102.02244.","DOI":"10.1109\/REDUNDANCY52534.2021.9606442"},{"key":"1102_CR22","doi-asserted-by":"crossref","unstructured":"Puchinger S., Renner J., Rosenkilde J.: Generic decoding in the sum-rank metric. IEEE Int. Symp. Inf. Theory 54\u201359 (2021).","DOI":"10.1109\/ISIT44484.2020.9174497"},{"key":"1102_CR23","doi-asserted-by":"crossref","unstructured":"Roth R.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inf. Theory (1991).","DOI":"10.1109\/18.75248"},{"key":"1102_CR24","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., 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":"1102_CR25","first-page":"338","volume":"139","author":"M Tsfasman","year":"2007","unstructured":"Tsfasman M., Vl\u01cedu\u0163 S., Nogin D.: Algebraic geometric codes: basic notions. Math. Surv. Monogr. 139, 338 (2007).","journal-title":"Math. Surv. Monogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01102-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01102-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01102-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T10:15:27Z","timestamp":1673086527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01102-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,7]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1102"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01102-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,7]]},"assertion":[{"value":"22 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}