{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:40Z","timestamp":1771611040754,"version":"3.50.1"},"reference-count":86,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"0","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2026]]},"DOI":"10.3934\/amc.2025035","type":"journal-article","created":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T09:35:29Z","timestamp":1753868129000},"page":"151-198","source":"Crossref","is-referenced-by-count":1,"title":["Fast decoding of interleaved linearized Reed\u2013Solomon codes and variants"],"prefix":"10.3934","volume":"20","author":[{"given":"Hannes","family":"Bartz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Puchinger","sequence":"additional","affiliation":[{"name":"Hensoldt Sensors GmbH, Ulm, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2025035-1","doi-asserted-by":"crossref","unstructured":"<p>W. W. Adams and P. Loustaunau, <i>An Introduction to Gr\u00f6bner Bases<\/i>, Grad. Stud. Math., 3, American Mathematical Society, Providence, RI, 1994.<\/p>","DOI":"10.1090\/gsm\/003"},{"key":"key-10.3934\/amc.2025035-2","unstructured":"<p>H. Bartz, <i>Algebraic Decoding of Subspace and Rank-Metric Codes<\/i>, PhD thesis, Technische Universit\u00e4t M\u00fcnchen, 2017.<\/p>"},{"key":"key-10.3934\/amc.2025035-3"},{"key":"key-10.3934\/amc.2025035-4","doi-asserted-by":"crossref","unstructured":"<p>H. Bartz, T. Jerkovits, S. Puchinger and J. Rosenkilde, Fast root finding for interpolation-based decoding of interleaved gabidulin codes, in <i>2019 IEEE Information Theory Workshop (ITW)<\/i>, IEEE, 2019, 1-5.<\/p>","DOI":"10.1109\/ITW44776.2019.8989290"},{"key":"key-10.3934\/amc.2025035-5","doi-asserted-by":"crossref","unstructured":"<p>H. Bartz, T. Jerkovits and J. Rosenkilde, Fast K\u00f6tter\u2013Nielsen\u2013H\u00f8holdt interpolation over skew polynomial rings, its application in coding theory, <i>IFAC-PapersOnLine<\/i>, <b>55<\/b> 2022), 1-6.<\/p>","DOI":"10.1016\/j.ifacol.2022.11.019"},{"key":"key-10.3934\/amc.2025035-6","doi-asserted-by":"crossref","unstructured":"<p>D. Bleichenbacher, A. Kiayias and M. Yung, Decoding of interleaved Reed\u2013Solomon codes over noisy data, in <i>International Colloquium on Automata, Languages, and Programming<\/i>, Springer, <b>2719<\/b> (2003), 97-108.<\/p>","DOI":"10.1007\/3-540-45061-0_9"},{"key":"key-10.3934\/amc.2025035-7","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00789-w"},{"key":"key-10.3934\/amc.2025035-8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9704-4"},{"key":"key-10.3934\/amc.2025035-9","doi-asserted-by":"crossref","unstructured":"<p>A. Brown, L. Minder and A. Shokrollahi, Probabilistic decoding of interleaved RS-codes on the q-ary symmetric channel, in <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, 2004,326-326.<\/p>","DOI":"10.1109\/ISIT.2004.1365363"},{"key":"key-10.3934\/amc.2025035-10","doi-asserted-by":"crossref","unstructured":"<p>A. Brown, L. Minder and A. Shokrollahi, Improved decoding of interleaved AG codes, in <i>IMA International Conference on Cryptography and Coding<\/i>, Springer, <b>3796<\/b> (2005), 37-46.<\/p>","DOI":"10.1007\/11586821_3"},{"key":"key-10.3934\/amc.2025035-11"},{"key":"key-10.3934\/amc.2025035-12","unstructured":"<p>X. Caruso, Residues of skew rational functions and linearized Goppa codes, arXiv preprint, arXiv: 1908.08430.<\/p>"},{"key":"key-10.3934\/amc.2025035-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.02.016"},{"key":"key-10.3934\/amc.2025035-14","doi-asserted-by":"crossref","unstructured":"<p>X. Caruso and J. Le Borgne, Fast multiplication for skew polynomials, <i>ISSAC'17-Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation<\/i>, Association for Computing Machinery (ACM), New York, 2017, 77-84.<\/p>","DOI":"10.1145\/3087604.3087617"},{"key":"key-10.3934\/amc.2025035-15","doi-asserted-by":"publisher","DOI":"10.2140\/obs.2013.1.271"},{"key":"key-10.3934\/amc.2025035-16","doi-asserted-by":"crossref","unstructured":"<p>D. Coppersmith and M. Sudan, Reconstructing curves in three (and higher) dimensional space from noisy data, in <i>ACM Symposium on the Theory of Computing<\/i>, 2003,136-142.<\/p>","DOI":"10.1145\/780542.780563"},{"key":"key-10.3934\/amc.2025035-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2008.07.004"},{"key":"key-10.3934\/amc.2025035-18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"key-10.3934\/amc.2025035-19"},{"key":"key-10.3934\/amc.2025035-20","unstructured":"<p>H. Gluesing-Luerssen, Introduction to skew-polynomial rings and skew-cyclic codes, in <i>Concise Encyclopedia of Coding Theory<\/i>, CRC Press, Boca Raton, FL, 2021,151-180.<\/p>"},{"key":"key-10.3934\/amc.2025035-21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-46495-9_2"},{"key":"key-10.3934\/amc.2025035-22","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-023-01214-8"},{"key":"key-10.3934\/amc.2025035-23","unstructured":"<p>F. H\u00f6rmann and H. Bartz, Syndrome-based error-erasure decoding of interleaved linearized Reed\u2013Solomon codes, <i>Submitted to: IEEE Transactions on Information Theory<\/i>, arXiv: 2411.19101.<\/p>"},{"key":"key-10.3934\/amc.2025035-24","doi-asserted-by":"crossref","unstructured":"<p>F. H\u00f6rmann and H. Bartz, Efficient decoding of folded linearized Reed\u2013Solomon codes in the Sum-Rank metric, in <i>International Workshop on Coding and Cryptography (WCC)<\/i>, 2022.<\/p>","DOI":"10.1109\/ISIT50566.2022.9834742"},{"key":"key-10.3934\/amc.2025035-25","unstructured":"<p>F. H\u00f6rmann, H. Bartz and A.-L. Horlemann, Security considerations for McEliece-like cryptosystems based on linearized Reed-Solomon codes in the sum-rank metric, <i>International Workshop on Code-Based Cryptography (CBCrypto)<\/i>.<\/p>"},{"key":"key-10.3934\/amc.2025035-26","unstructured":"<p>T. Jerkovits, F. H\u00f6rmann and H. Bartz, On decoding high-order interleaved sum-rank- and skew-metric codes, <i>International Workshop on Code-Based Cryptography (CBCrypto)<\/i>.<\/p>"},{"key":"key-10.3934\/amc.2025035-27","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-020-00449-9"},{"key":"key-10.3934\/amc.2025035-28","doi-asserted-by":"crossref","unstructured":"<p>W. K. Kadir, C. Li and F. Zullo, On interpolation-based decoding of a class of maximum rank distance codes, in <i>2021 IEEE International Symposium on Information Theory (ISIT)<\/i>, IEEE, 2021, 31-36.<\/p>","DOI":"10.1109\/ISIT45174.2021.9517980"},{"key":"key-10.3934\/amc.2025035-29","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-022-00578-3"},{"key":"key-10.3934\/amc.2025035-30","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9625-2"},{"key":"key-10.3934\/amc.2025035-31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"key-10.3934\/amc.2025035-32","doi-asserted-by":"publisher","DOI":"10.1109\/20.617715"},{"key":"key-10.3934\/amc.2025035-33","unstructured":"<p>V. Y. Krachkovsky and Y. X. Lee, Decoding of parallel Reed\u2013Solomon codes with applications to product and concatenated codes, in <i>IEEE ISIT<\/i>, 1998.<\/p>"},{"key":"key-10.3934\/amc.2025035-34"},{"key":"key-10.3934\/amc.2025035-35","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(88)90063-4"},{"key":"key-10.3934\/amc.2025035-36","doi-asserted-by":"crossref","unstructured":"<p>F. Le Gall, Powers of tensors and fast matrix multiplication, in <i>International Symposium on Symbolic and Algebraic Computation (ISSAC)<\/i>, 2014,296-303.<\/p>","DOI":"10.1145\/2608628.2608664"},{"key":"key-10.3934\/amc.2025035-37","doi-asserted-by":"crossref","unstructured":"<p>A. Leroy et al., Pseudolinear transformations and evaluation in Ore extensions, <i>Bulletin of the Belgian Mathematical Society-Simon Stevin<\/i>, <b>2<\/b> (1995), 321-347.<\/p>","DOI":"10.36045\/bbms\/1103408724"},{"key":"key-10.3934\/amc.2025035-38","doi-asserted-by":"crossref","unstructured":"<p>C. Li, Interpolation-based decoding of nonlinear maximum rank distance codes, in <i>2019 IEEE International Symposium on Information Theory (ISIT)<\/i>, IEEE, 2019, 2054-2058.<\/p>","DOI":"10.1109\/ISIT.2019.8849472"},{"key":"key-10.3934\/amc.2025035-39","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9784-1"},{"key":"key-10.3934\/amc.2025035-40","doi-asserted-by":"crossref","unstructured":"<p>S. Liu, F. Manganiello and F. R. Kschischang, Construction and decoding of generalized skew-evaluation codes, in <i>2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)<\/i>, IEEE, 2015, 9-13.<\/p>","DOI":"10.1109\/CWIT.2015.7255141"},{"key":"key-10.3934\/amc.2025035-41","unstructured":"<p>P. Loidreau and R. Overbeck, Decoding rank errors beyond the error-correction capability, <i>International Workshop on Algebraic and Combinatorial Coding Theory (ACCT)<\/i>.<\/p>"},{"key":"key-10.3934\/amc.2025035-42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846403"},{"key":"key-10.3934\/amc.2025035-43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2570238"},{"key":"key-10.3934\/amc.2025035-44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2018.02.005"},{"key":"key-10.3934\/amc.2025035-45","doi-asserted-by":"crossref","unstructured":"<p>U. Mart\u00ednez-Pe\u00f1as, Private information retrieval from locally repairable databases with colluding servers, in <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, IEEE, 2019, 1057-1061.<\/p>","DOI":"10.1109\/ISIT.2019.8849528"},{"key":"key-10.3934\/amc.2025035-46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3088712"},{"key":"key-10.3934\/amc.2025035-47","doi-asserted-by":"publisher","DOI":"10.1137\/20M1386001"},{"key":"key-10.3934\/amc.2025035-48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102272"},{"key":"key-10.3934\/amc.2025035-49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2912165"},{"key":"key-10.3934\/amc.2025035-50","unstructured":"<p>U. Mart\u00ednez-Pe\u00f1as and F. R. Kschischang, Universal and dynamic locally repairable codes with maximal recoverability via Sum-Rank codes, <i>IEEE Transactions on Information Theory<\/i>.<\/p>"},{"key":"key-10.3934\/amc.2025035-51","doi-asserted-by":"publisher","DOI":"10.1561\/0100000120"},{"key":"key-10.3934\/amc.2025035-52","doi-asserted-by":"crossref","unstructured":"<p>D. Napp, R. Pinto, J. Rosenthal and P. Vettori, MRD rank metric convolutional codes, in <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, IEEE, 2017, 2766-2770.<\/p>","DOI":"10.1109\/ISIT.2017.8007033"},{"key":"key-10.3934\/amc.2025035-53","doi-asserted-by":"crossref","unstructured":"<p>D. Napp, R. Pinto, J. Rosenthal and P. Vettori, Faster decoding of rank metric convolutional codes, in <i>23rd International Symposium on Mathematical Theory of Networks and Systems<\/i>, 2018.<\/p>","DOI":"10.1109\/ISIT.2017.8007033"},{"key":"key-10.3934\/amc.2025035-54","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2022.06.027"},{"key":"key-10.3934\/amc.2025035-55","doi-asserted-by":"crossref","unstructured":"<p>A. Neri, P. Santonastaso and F. Zullo, The geometry of one-weight codes in the sum-rank metric, <i>Journal of Combinatorial Theory, Series A<\/i>, <b>194<\/b> (2023), Paper No. 105703, 41 pp.<\/p>","DOI":"10.1016\/j.jcta.2022.105703"},{"key":"key-10.3934\/amc.2025035-56","doi-asserted-by":"crossref","unstructured":"<p>J. S. Nielsen, Generalised multi-sequence shift-register synthesis using module minimisation, in <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, 2013,882-886.<\/p>","DOI":"10.1109\/ISIT.2013.6620353"},{"key":"key-10.3934\/amc.2025035-57","doi-asserted-by":"crossref","unstructured":"<p>R. W. N\u00f3brega and B. F. Uch\u00f4a-Filho, Multishot codes for network coding using rank-metric codes, in <i>2010 Third IEEE International Workshop on Wireless Network Coding<\/i>, IEEE, 2010, 1-6.<\/p>","DOI":"10.1109\/WINC.2010.5507933"},{"key":"key-10.3934\/amc.2025035-58","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1933-1501703-0"},{"key":"key-10.3934\/amc.2025035-59"},{"key":"key-10.3934\/amc.2025035-60","unstructured":"<p>R. Overbeck, <i>Public key cryptography based on coding theory<\/i>, PhD thesis, Technische Universit\u00e4t, 2007.<\/p>"},{"key":"key-10.3934\/amc.2025035-61","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9003-9"},{"key":"key-10.3934\/amc.2025035-62","unstructured":"<p>F. Parvaresh, <i>Algebraic list-decoding of error-correcting codes<\/i>, PhD thesis, University of California, San Diego, 2007.<\/p>"},{"key":"key-10.3934\/amc.2025035-63","unstructured":"<p>F. Parvaresh and A. Vardy, Multivariate interpolation decoding beyond the Guruswami\u2013Sudan radius, in <i>Allerton Conference on Communication, Control and Computing<\/i>, 2004.<\/p>"},{"key":"key-10.3934\/amc.2025035-64","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2017.02.029"},{"key":"key-10.3934\/amc.2025035-65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3167629"},{"key":"key-10.3934\/amc.2025035-66","doi-asserted-by":"crossref","unstructured":"<p>S. Puchinger and J. Rosenkilde, Bounds on list decoding of linearized Reed\u2013Solomon codes, in <i>2021 IEEE International Symposium on Information Theory (ISIT)<\/i>, IEEE, 2021,154-159.<\/p>","DOI":"10.1109\/ISIT45174.2021.9517777"},{"key":"key-10.3934\/amc.2025035-67","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0577-z"},{"key":"key-10.3934\/amc.2025035-68","doi-asserted-by":"crossref","unstructured":"<p>S. Puchinger and J. Rosenkilde n\u00e9 Nielsen, Decoding of interleaved Reed\u2013Solomon codes using improved power decoding, in <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, 2017.<\/p>","DOI":"10.1109\/ISIT.2017.8006549"},{"key":"key-10.3934\/amc.2025035-69","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0257-9"},{"key":"key-10.3934\/amc.2025035-70","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2017.11.012"},{"key":"key-10.3934\/amc.2025035-71","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"key-10.3934\/amc.2025035-72","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.21972"},{"key":"key-10.3934\/amc.2025035-73","doi-asserted-by":"publisher","DOI":"10.4171\/emss\/77"},{"key":"key-10.3934\/amc.2025035-74","doi-asserted-by":"crossref","unstructured":"<p>G. Schmidt, V. Sidorenko and M. Bossert, Enhancing the correcting radius of interleaved Reed\u2013Solomon decoding using syndrome extension techniques, in <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, 2007, 1341-1345.<\/p>","DOI":"10.1109\/ISIT.2007.4557409"},{"key":"key-10.3934\/amc.2025035-75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021308"},{"key":"key-10.3934\/amc.2025035-76","doi-asserted-by":"crossref","unstructured":"<p>V. Sidorenko and M. Bossert, Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis, in <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, 2010, 1148-1152.<\/p>","DOI":"10.1109\/ISIT.2010.5513676"},{"key":"key-10.3934\/amc.2025035-77","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9663-9"},{"key":"key-10.3934\/amc.2025035-78","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2096032"},{"key":"key-10.3934\/amc.2025035-79","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946011020049"},{"key":"key-10.3934\/amc.2025035-80","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274653"},{"key":"key-10.3934\/amc.2025035-81","doi-asserted-by":"crossref","unstructured":"<p>A. Wachter-Zeh, <i>Decoding of block and convolutional codes in rank metric<\/i>, PhD thesis, Ulm University and Universit\u00e9 Rennes 1, 2013.<\/p>","DOI":"10.1109\/NETCOD.2012.6261875"},{"key":"key-10.3934\/amc.2025035-82","doi-asserted-by":"crossref","unstructured":"<p>A. Wachter-Zeh and V. Sidorenko, Rank-metric convolutional codes for random linear network coding, in <i>2012 International Symposium on Network Coding (NetCod)<\/i>, IEEE, 2012, 1-6.<\/p>","DOI":"10.1109\/NETCOD.2012.6261875"},{"key":"key-10.3934\/amc.2025035-83","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424930"},{"key":"key-10.3934\/amc.2025035-84","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9953-5"},{"key":"key-10.3934\/amc.2025035-85","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9728-9"},{"key":"key-10.3934\/amc.2025035-86"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T08:30:14Z","timestamp":1758616214000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2025035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":86,"journal-issue":{"issue":"0","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2025035","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}