{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:47:16Z","timestamp":1773236836510,"version":"3.50.1"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/tit.2011.2162173","type":"journal-article","created":{"date-parts":[[2011,9,12]],"date-time":"2011-09-12T19:28:06Z","timestamp":1315855686000},"page":"6025-6032","source":"Crossref","is-referenced-by-count":22,"title":["Linearized Shift-Register Synthesis"],"prefix":"10.1109","volume":"57","author":[{"given":"Vladimir","family":"Sidorenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Bossert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"berlekamp","year":"1968","journal-title":"Algebraic Coding Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365435"},{"key":"ref13","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 and Channel Coding"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558679"},{"key":"ref15","article-title":"Synthesizing all linearized shift-registers of the minimal or required length","author":"sidorenko","year":"2010","journal-title":"Proc 4th Int ITG Conf Source and Channel Coding"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946011020062"},{"key":"ref17","author":"blahut","year":"1983","journal-title":"Theory and Practice of Error Control Codes"},{"key":"ref18","first-page":"298","article-title":"A fast linearized Euclidean algorithm for decoding Gabidulin codes","author":"wachter","year":"2010","journal-title":"Proc 12th Int Workshop on Algebr Combinator Coding Theory (ACCT-12)"},{"key":"ref19","first-page":"162","article-title":"Fast recursive linearized feedback shift register synthesis","author":"hassan","year":"2010","journal-title":"Proc 12th Int Workshop on Algebr Combinator Coding Theory (ACCT-12)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10623-008-9185-7","volume":"49","author":"gabidulin","year":"2008","journal-title":"Designs Codes and Cryptography"},{"key":"ref8","article-title":"An analogue of Berlekamp-Massey algorithm for decoding codes in rank metric","author":"paramonov","year":"1991","journal-title":"Proc Moscow Inst Physics and Technology"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90090-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref1","first-page":"1","article-title":"Theory of codes with maximal rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inf Transm"},{"key":"ref9","author":"paramonov","year":"1992","journal-title":"Channel coding and secure data transmission in parallel channels"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2096032"},{"key":"ref22","author":"schaub","year":"1988","journal-title":"A linear complexity approach to cyclic codes"},{"key":"ref21","author":"lidl","year":"1983","journal-title":"Finite Fields"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.133246"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6006569\/06006607.pdf?arnumber=6006607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:42Z","timestamp":1633909662000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6006607\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":23,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2162173","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}