{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:23Z","timestamp":1772283623437,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513676","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"1148-1152","source":"Crossref","is-referenced-by-count":23,"title":["Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis"],"prefix":"10.1109","author":[{"given":"Vladimir","family":"Sidorenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Bossert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"36","article-title":"Welch-Berlecamp like algorithm for decoding Gabidulin codes","author":"loidreau","year":"2005","journal-title":"Proc 4th Int Workshop on Coding and Cryptography"},{"key":"ref11","article-title":"Finite Fields","author":"lidl","year":"1983"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558679"},{"key":"ref13","article-title":"Synthesizing All Linearized Shift-Registers of the Minimal or Required Length","author":"sidorenko","year":"2010","journal-title":"Int ITG Conf Source and Channel Coding"},{"key":"ref14","article-title":"Algebraic Coding Theory","author":"berlekamp","year":"1968"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946011020062"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513676"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162173"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref3","first-page":"1","article-title":"Theory of codes with maximal rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"ref6","first-page":"168","article-title":"Decoding rank errors beyond the error-correction capability","volume":"acct i0","author":"loidreau","year":"2006","journal-title":"Proc Int Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref8","article-title":"An analogue of Berlekamp - Massey algorithm for decoding codes in rank metric","author":"paramonov","year":"1991","journal-title":"Proceed M"},{"key":"ref7","article-title":"Decoding interleaved Gabidulin codes and ciphertext-security for GPT variants","author":"overbeck","year":"0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365435"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","location":"Austin, TX, USA","start":{"date-parts":[[2010,6,13]]},"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\/05513676.pdf?arnumber=5513676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T16:10:29Z","timestamp":1489853429000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513676\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513676","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}