{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:49:17Z","timestamp":1730274557457,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100010661","name":"European Union's Horizon 2020 research and innovation programme","doi-asserted-by":"publisher","award":["713683"],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"European Research Council (ERC)","doi-asserted-by":"publisher","award":["801434"],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517904","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T20:52:42Z","timestamp":1630529562000},"page":"25-30","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Decoding of Gabidulin Codes over Galois Rings"],"prefix":"10.1109","author":[{"given":"Sven","family":"Puchinger","sequence":"first","affiliation":[]},{"given":"Julian","family":"Renner","sequence":"additional","affiliation":[]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Zumbragel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.986002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3789-9_5"},{"volume":"28","journal-title":"Finite Rings with Identity","year":"1974","author":"mcdonald","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.412677"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9632-3"},{"key":"ref15","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref16","first-page":"126","article-title":"A fast matrix decoding algorithm for rank-error-correcting codes","author":"gabidulin","year":"1991","journal-title":"Workshop on Algebraic Coding"},{"journal-title":"Decoding of Block and Convolutional Codes in Rank Metric","year":"2013","author":"wachter-zeh","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2017.11.012"},{"journal-title":"Algorithms for Matrix Canonical Forms","year":"2000","author":"storjohann","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2933520"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165816"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2068750"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2451623"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274264"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778726"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2346079"},{"key":"ref9","first-page":"36","article-title":"A Welch-Berlekamp like algorithm for decoding Gabidulin codes","volume":"3969","author":"loidreau","year":"2006","journal-title":"Coding and Cryptography - Revised selected papers of WCC 2005"},{"journal-title":"ArXiv Preprint","article-title":"Some algorithms for skew polynomials over finite fields","year":"2012","author":"caruso","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087617"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2021,7,12]]},"location":"Melbourne, Australia","end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517904.pdf?arnumber=9517904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:45:12Z","timestamp":1652197512000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517904\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517904","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}
