{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:47:21Z","timestamp":1730274441385,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513681","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"1143-1147","source":"Crossref","is-referenced-by-count":3,"title":["A basis for all solutions of the key equation for Gabidulin codes"],"prefix":"10.1109","author":[{"given":"Antonia","family":"Wachter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Sidorenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Bossert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"journal-title":"Finite Fields ser Enc of Mathematics and its Applications","year":"1996","author":"lidl","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365435"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90090-X"},{"article-title":"An analogue of Berlekamp-Massey algorithm for decoding codes in rank metric","year":"1991","author":"paramonov","key":"ref5"},{"key":"ref8","article-title":"Synthesizing all linearized shift-registers of the minimal or required length","author":"sidorenko","year":"2010","journal-title":"ITG Conf on Source and Channel Coding"},{"key":"ref7","article-title":"Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm","author":"richter","year":"2004","journal-title":"ITG Conference on Source and Channel Coding (SCC) 2004"},{"key":"ref2","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Peredachi Inf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595299"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513681.pdf?arnumber=5513681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T16:38:48Z","timestamp":1489855128000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513681","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}