{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,8]],"date-time":"2026-09-08T15:01:32Z","timestamp":1788879692686,"version":"build-2803163510"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology of Taiwan","doi-asserted-by":"publisher","award":["MOST111-2218-E-A49-024"],"award-info":[{"award-number":["MOST111-2218-E-A49-024"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1109\/tit.2023.3236720","type":"journal-article","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:02:17Z","timestamp":1673647337000},"page":"3759-3774","source":"Crossref","is-referenced-by-count":3,"title":["The Partial-Inverse Approach to Linearized Polynomials and Gabidulin Codes With Applications to Network Coding"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1124-7346","authenticated-orcid":false,"given":"Jiun-Hung","family":"Yu","sequence":"first","affiliation":[{"name":"Department of Electronics and Electrical Engineering, Institute of Communications Engineering, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7153-7145","authenticated-orcid":false,"given":"Hans-Andrea","family":"Loeliger","sequence":"additional","affiliation":[{"name":"Department of Information Technology and Electrical Engineering, ETH Zürich, Zürich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"2614","DOI":"10.1109\/18.887869","article-title":"On the equivalence of the Berlekamp–Massey and the Euclidean algorithms for decoding","volume":"46","author":"heydtmann","year":"2000","journal-title":"IEEE Trans Inf Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057299"},{"key":"ref15","first-page":"40","article-title":"Practical network coding","author":"chou","year":"2003","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2011.5872142"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02181-7_4"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028554"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613559"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2868701"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2912165"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282885"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_19"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620419"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0257-9"},{"key":"ref46","author":"berlekamp","year":"1986","journal-title":"Error correction of algebraic block codes"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_4"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2096032"},{"key":"ref47","first-page":"186","article-title":"Decoding rank errors beyond the error-correcting capability","author":"loidreau","year":"2006","journal-title":"Proc 10th Int Workshop Algebr Combinat Coding Theory (ACCT)"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162173"},{"key":"ref41","first-page":"249","article-title":"Error and erasure decoding of rank-codes with a modified Berlekamp–Massey algorithm","author":"richter","year":"2004","journal-title":"Proc ITG Conf Source Channel Coding"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"ref43","author":"berlekamp","year":"1968","journal-title":"Algebraic Coding Theory"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9953-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205272"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2018.02.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref3","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2007.375706"},{"key":"ref40","article-title":"An analogue of Berlekamp–Massey algorithm for decoding codes in rank metric","author":"paramonov","year":"0"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3067318"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0346-4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9659-5"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90090-X"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424930"},{"key":"ref30","article-title":"Decoding of block and convolutional codes in rank metric","author":"wachter-zeh","year":"2013"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2779851"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555949"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849588"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3789-9_5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/18.21269"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507933"},{"key":"ref68","article-title":"On polynomial remainder codes","author":"yu","year":"2012","journal-title":"arXiv 1201 1812"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1933-1501703-0"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033721"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9704-4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/1968173"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.818023"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2017.11.012"},{"key":"ref63","first-page":"1","article-title":"Correcting generalized matrix erasures with applications to random network coding","author":"gabidulin","year":"2010","journal-title":"Proc Int ITG Conf Source Channel Coding (SCC)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846403"},{"key":"ref65","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref28","first-page":"1991","article-title":"An algorithm for decoding skew Reed–Solomon codes with respect to the skew metric","author":"boucher","year":"2019","journal-title":"Proc Workshop Coding Cryptogr"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2015.7255141"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034013"},{"key":"ref60","first-page":"11","article-title":"Rank errors and rank erasures correction","author":"gabidulin","year":"1991","journal-title":"Proc 4th Int Colloq Coding Theory"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9185-7"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365435"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10130037\/10016624.pdf?arnumber=10016624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T18:01:07Z","timestamp":1686592867000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10016624\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":68,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3236720","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6]]}}}