{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:17Z","timestamp":1773377537173,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849588","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2059-2063","source":"Crossref","is-referenced-by-count":1,"title":["Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials"],"prefix":"10.1109","author":[{"given":"Jiun-Hung","family":"Yu","sequence":"first","affiliation":[{"name":"Dept. of Electrical and Computer Engineering, National Chiao Tung University, Taiwan"}]},{"given":"Hans-Andrea","family":"Loeliger","sequence":"additional","affiliation":[{"name":"Dept. of Information Technology and Electrical Engineering, ETH, Zurich, Switzerland"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Decoding of block and convolutional codes in rank metric","author":"wachter-zeh","year":"2013","journal-title":"PhD dissertation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2017.11.012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613559"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2868701"},{"key":"ref14","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1933-1501703-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2007.375706"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205272"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162173"},{"key":"ref7","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 on Source and Channel Coding"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref1","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inform Transm"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9659-5"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849588.pdf?arnumber=8849588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:18Z","timestamp":1773347658000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849588","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}