{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:38Z","timestamp":1771611038796,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T00:00:00Z","timestamp":1333411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10623-012-9663-9","type":"journal-article","created":{"date-parts":[[2012,4,2]],"date-time":"2012-04-02T05:52:20Z","timestamp":1333345940000},"page":"55-67","source":"Crossref","is-referenced-by-count":15,"title":["Fast skew-feedback shift-register synthesis"],"prefix":"10.1007","volume":"70","author":[{"given":"Vladimir","family":"Sidorenko","sequence":"first","affiliation":[]},{"given":"Martin","family":"Bossert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,3]]},"reference":[{"key":"9663_CR1","volume-title":"Theory and practice of error control codes","author":"R.E. Blahut","year":"1983","unstructured":"Blahut R.E.: Theory and practice of error control codes. Addison-Wesley, Reading (1983)"},{"key":"9663_CR2","doi-asserted-by":"crossref","first-page":"480","DOI":"10.2307\/1968173","volume":"34","author":"O. Ore","year":"1933","unstructured":"Ore O.: Theory of non-commutative polynomials. Ann. Math. 34, 480\u2013508 (1933)","journal-title":"Ann. Math."},{"key":"9663_CR3","unstructured":"Hassan Y., Sidorenko V.: Fast recursive linearized feedback shift register synthesis In: 12th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-12), Akademgorodok, Novosibirsk (2010)."},{"key":"9663_CR4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sh\u00f6nhage","year":"1971","unstructured":"Sh\u00f6nhage A., Strassen V.: Schnelle Multiplikation gro\u00dfer Zahlen\u201d. Computing 7, 281\u2013292 (1971)","journal-title":"Computing"},{"key":"9663_CR5","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TIT.2010.2096032","volume":"IT-57","author":"V. Sidorenko","year":"2011","unstructured":"Sidorenko V., Jiang L., Bossert M.: Skew-feedback shift-register synthesis and decoding interleaved Gabidulin codes. IEEE Trans. Inf. Theory IT-57, 621\u2013632 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9663_CR6","unstructured":"Wachter A., Afanassiev V., Sidorenko V.: Fast decoding of Gabidulin codes. The 7th International Workshop on Coding and Cryptography 2011, pp. 433\u2013442. Paris (2011)."},{"issue":"4","key":"9663_CR7","doi-asserted-by":"crossref","first-page":"667","DOI":"10.3934\/amc.2011.5.667","volume":"5","author":"A. Zeh","year":"2011","unstructured":"Zeh A., Wachter A.: Fast multi-sequence shift-register synthesis with the Euclidean algorithm. Adv. Math. Commun. 5(4), 667\u2013680 (2011)","journal-title":"Adv. Math. Commun."},{"key":"9663_CR8","doi-asserted-by":"crossref","first-page":"2991","DOI":"10.1109\/TIT.2009.2021308","volume":"55","author":"G. Schmidt","year":"2009","unstructured":"Schmidt G., Sidorenko V.R., Sidorenko V.R.: Collaborative decoding of interleaved Reed\u2013Solomon codes and concatenated code designs. IEEE Trans. Inf. Theory 55, 2991\u20133012 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"9663_CR9","doi-asserted-by":"crossref","first-page":"5245","DOI":"10.1109\/TIT.2010.2060130","volume":"56","author":"G. Schmidt","year":"2010","unstructured":"Schmidt G., Sidorenko V.R., Bossert M.: Syndrome decoding of Reed\u2013Solomon codes beyond half the minimum distance based on shift- register synthesis. IEEE Trans. Inf. Theory 56(10), 5245\u20135252 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9663_CR10","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp E.R.: Algebraic Coding Theory. McGraw\u2013Hill, New York (1968)"},{"key":"9663_CR11","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT-15","author":"J.L. Massey","year":"1969","unstructured":"Massey J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory IT-15, 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9663_CR12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(75)90090-X","volume":"27","author":"Y. Sugiyama","year":"1975","unstructured":"Sugiyama Y., Kasahara M., Hirasawa S., Namekawa T.: A method for solving key equations for decoding Goppa codes. Inf. Control 27, 87\u201399 (1975)","journal-title":"Inf. Control"},{"issue":"129","key":"9663_CR13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1090\/S0025-5718-1975-0369276-7","volume":"29","author":"W.H. Mills","year":"1975","unstructured":"Mills W.H.: Continued fractions and linear recurrences. Math. Comput. 29(129), 173\u2013180 (1975)","journal-title":"Math. Comput."},{"key":"9663_CR14","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1109\/18.133246","volume":"IT-37","author":"G.-L. Feng","year":"1991","unstructured":"Feng G.-L., Tzeng K.K.: A generalization of the Berlekamp\u2013Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes. IEEE Trans. Inf. Theory IT-37, 1274\u20131287 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9663_CR15","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/18.30981","volume":"35","author":"G.-L. Feng","year":"1989","unstructured":"Feng G.-L., Tzeng K.K.: A generalized Euclidean algorithm for multisequence shift-register synthesis. IEEE Trans. Inf. Theory 35(3), 584\u2013594 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9663_CR16","doi-asserted-by":"crossref","first-page":"2905","DOI":"10.1109\/TIT.2004.836670","volume":"IT-50","author":"L.-P. Wang","year":"2004","unstructured":"Wang L.-P., Zhu Y.-F., Pei D.-Y.: On the lattice basis reduction multisequence synthesis algorithm. IEEE Trans. Inf. Theory IT-50, 2905\u20132910 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9663_CR17","first-page":"125","volume":"35","author":"V.L. Kurakin","year":"1999","unstructured":"Kurakin V.L.: The Berlekamp\u2013Massey algorithm over a finite commutative ring, Probl. Inf. Transm. 35(2), 125\u2013135 (1999)","journal-title":"Inf. Transm."},{"issue":"4","key":"9663_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0167-6911(97)00059-5","volume":"31","author":"M. Kuijper","year":"1997","unstructured":"Kuijper M.: An algorithm for constructing a minimal partial realization in the multivariable case. Syst. Control Lett. 31(4), 225\u2013233 (1997)","journal-title":"Syst. Control Lett."},{"key":"9663_CR19","unstructured":"Sakata S.: The BM algorithm and the BMS algorithm. In: Vardy A. (ed.) Codes, Curves and Signals: Common Threads in Communications, pp. 39\u201352. Boston, Kluwer Academic Publishers, ISBN 0-792-38374-5, (1998)."},{"key":"9663_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1134\/S0032946011020062","volume":"47","author":"V. Sidorenko","year":"2011","unstructured":"Sidorenko V., Schmidt G.: A linear algebraic approach to multisequence shift-register synthesis. Probl. Inf. Transm. 47, 149\u2013165 (2011)","journal-title":"Probl. Inf. Transm."},{"key":"9663_CR21","unstructured":"Wang L.P., Wang Q.L., Wang K.P.: A lattice-based shift-register synthesis for multi-sequences of varying length. In: Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT 2008), 6\u201311 July, pp. 1751\u20131754. Toronto, Canada (2008)."},{"key":"9663_CR22","first-page":"1","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximal rank distance. Probl. Inf. Transm. (English translation). 21, 1\u201312 (1985)","journal-title":"Probl. Inf. Transm. (English translation)."},{"key":"9663_CR23","unstructured":"Paramonov A.V., Tretjakov O.V.: An analogue of Berlekamp\u2013Massey algorithm for decoding codes in rank metric. In: Proceedings of Moscow Institute for Physics and Technology (MIPT), Moscow, Russia (In Russian) (1991)."},{"key":"9663_CR24","unstructured":"Richter G., Plass S.: Error and erasure decoding of rank-codes with a modified Berlekamp\u2013Massey algorithm. Proceedings of ITG Conference on Source and Channel Coding, pp. 249\u2013256. Erlangen, Germany (2004)."},{"issue":"9","key":"9663_CR25","doi-asserted-by":"crossref","first-page":"6025","DOI":"10.1109\/TIT.2011.2162173","volume":"IT-57","author":"V. Sidorenko","year":"2011","unstructured":"Sidorenko V., Richter G., Bossert M.: Linearized shift-register synthesis. IEEE Trans. Inf. Theory IT-57(9), 6025\u20136032 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9663_CR26","unstructured":"Wachter A., Sidorenko V., Bossert M.: A fast linearized Euclidean algorithm for decoding Gabidulin codes. In: Proceedings of 12th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2012), pp. 298\u2013303. Akademgorodok, Novosibirsk, Russia (2010)."},{"key":"9663_CR27","unstructured":"Sidorenko V., Bossert M.: Fast skew-feedback shift-register synthesis. In: Borges J., Villanueva M. (eds.) 3rd International Castle meeting on Coding Theory and Applications, pp. 267\u2013272. Spain, Cardona (2011)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9663-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9663-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9663-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:33Z","timestamp":1559246313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9663-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,3]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9663"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9663-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,3]]}}}