{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:21:18Z","timestamp":1775013678089,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1134\/s0032946011020062","type":"journal-article","created":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T22:10:50Z","timestamp":1310508650000},"page":"149-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A linear algebraic approach to multisequence shift-register synthesis"],"prefix":"10.1134","volume":"47","author":[{"given":"V. R.","family":"Sidorenko","sequence":"first","affiliation":[]},{"given":"G.","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2011,7,14]]},"reference":[{"issue":"1","key":"4107_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J.L. Massey","year":"1969","unstructured":"Massey, J.L., Shift-Register Synthesis and BCH Decoding, IEEE Trans. Inform. Theory, 1969, vol. 15, no. 1, pp. 122\u2013127.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4107_CR2","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/18.133246","volume":"37","author":"G.-L. Feng","year":"1991","unstructured":"Feng, G.-L. and Tzeng, K.K., A Generalization of the Berlekamp-Massey Algorithm for Multisequence Shift-Register Synthesis with Applications to Decoding Cyclic Codes, IEEE Trans. Inform. Theory, 1991, vol. 37, no. 5, pp. 1274\u20131287.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4107_CR3","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-45061-0_9","volume-title":"Proc. 30th Int. Colloq. on Automata, Languages and Programming (ICALP\u20192003), Eindhoven, the Netherlands, 2003","author":"D. Bleichenbacher","year":"2003","unstructured":"Bleichenbacher, D., Kiayias, A., and Yung, M., Decoding of Interleaved Reed-Solomon Codes over Noisy Data, Proc. 30th Int. Colloq. on Automata, Languages and Programming (ICALP\u20192003), Eindhoven, the Netherlands, 2003, Baeten, J.C.M., Lenstra, J.K., Parrow, J., and Woeginger, G.J., Eds., Lect. Notes Comp. Sci., vol. 2719, Berlin: Springer, 2003, pp. 97\u2013108."},{"key":"4107_CR4","first-page":"22","volume-title":"Proc. Int. Workshop on Coding and Cryptography (WCC\u20192005), Bergen, Norway, 2005","author":"G. Schmidt","year":"2006","unstructured":"Schmidt, G., Sidorenko, V.R., and Bossert, M., Error and Erasure Correction of Interleaved Reed-Solomon Codes, Proc. Int. Workshop on Coding and Cryptography (WCC\u20192005), Bergen, Norway, 2005, Ytrehus,, vol. 3969, Berlin: Springer, 2006, pp. 22\u201335."},{"key":"4107_CR5","doi-asserted-by":"crossref","unstructured":"Brown, A., Minder, L., and Shokrollahi, A., Probabilistic Decoding of Interleaved RS-Codes on the q-ary Symmetric Channel, in Proc. 2004 IEEE Int. Sympos. on Information Theory (ISIT\u20192004), Chicago, USA, 2004, p. 326.","DOI":"10.1109\/ISIT.2004.1365363"},{"issue":"7","key":"4107_CR6","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1109\/TIT.2009.2021308","volume":"55","author":"G. Schmidt","year":"2009","unstructured":"Schmidt, G., Sidorenko, V.R., and Bossert, M., Collaborative Decoding of Interleaved Reed-Solomon Codes and Concatenated Code Designs, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 7, pp. 2991\u20133012.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4107_CR7","unstructured":"Justesen, J., Thommesen, C., and H\u00f8holdt, T., Decoding of Concatenated Codes with Interleaved Outer Codes, in Proc. 2004 IEEE Int. Sympos. on Information Theory (ISIT\u20192004), Chicago, USA, 2004, p. 329."},{"key":"4107_CR8","doi-asserted-by":"crossref","unstructured":"Krachkovsky, V.Yu., Lee, Y.X., and Garg, H.K,. Decoding of Parallel Reed-Solomon Codes with Applications to Product and Concatenated Codes, in Proc. 1998 IEEE Int. Sympos. on Information Theory (ISIT\u201998), Boston, USA, 1998, p. 55.","DOI":"10.1109\/ISIT.1998.708636"},{"issue":"11","key":"4107_CR9","doi-asserted-by":"publisher","first-page":"2975","DOI":"10.1109\/TIT.2003.819333","volume":"49","author":"V.Yu. Krachkovsky","year":"2003","unstructured":"Krachkovsky, V.Yu., Reed-Solomon Codes for Correcting Phased Error Bursts, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 11, pp. 2975\u20132984.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4107_CR10","doi-asserted-by":"crossref","unstructured":"Schmidt, G., Sidorenko, V.R., and Bossert, M., Decoding Reed-Solomon Codes beyond Half the Minimum Distance Using Shift-Register Synthesis, in Proc. 2006 IEEE Int. Sympos. on Information Theory (ISIT\u20192006), Seattle, USA, 2006, pp. 459\u2013463.","DOI":"10.1109\/ISIT.2006.261711"},{"issue":"10","key":"4107_CR11","doi-asserted-by":"publisher","first-page":"5245","DOI":"10.1109\/TIT.2010.2060130","volume":"56","author":"G. Schmidt","year":"2010","unstructured":"Schmidt, G., Sidorenko, V.R., and Bossert, M., Syndrome Decoding of Reed-Solomon Codes beyond Half the Minimum Distance Based on Shift-Register Synthesis, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 10, pp. 5245\u20135252.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"4107_CR12","doi-asserted-by":"publisher","first-page":"2740","DOI":"10.1109\/20.617715","volume":"33","author":"V.Yu. Krachkovsky","year":"1997","unstructured":"Krachkovsky, V.Yu. and Lee, Y.X., Decoding for Iterative Reed-Solomon Coding Schemes, IEEE Trans. Magn., 1997, vol. 33, no. 5, pp. 2740\u20132742.","journal-title":"IEEE Trans. Magn."},{"key":"4107_CR13","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R., Algebraic Coding Theory, New York: McGraw-Hill, 1968. Translated under the title Algebraicheskaya teoriya kodirovaniya, Moscow: Mir, 1971."},{"issue":"1","key":"4107_CR14","doi-asserted-by":"publisher","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., and Namekawa, T., A Method for Solving Key Equation for Decoding Goppa Codes, Inform. Control, 1975, vol. 27, no. 1, pp. 87\u201399.","journal-title":"Inform. Control"},{"issue":"129","key":"4107_CR15","doi-asserted-by":"publisher","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., 1975, vol. 29, no. 129, pp. 173\u2013180.","journal-title":"Math. Comput."},{"issue":"3","key":"4107_CR16","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1109\/18.30981","volume":"35","author":"G.-L. Feng","year":"1989","unstructured":"Feng, G.-L. and Tzeng, K.K., A Generalized Euclidean Algorithm for Multisequence Shift-Register Synthesis, IEEE Trans. Inform. Theory, 1989, vol. 35, no. 3, pp. 584\u2013594.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4107_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-1-4615-5121-8_4","volume-title":"Codes, Curves, and Signals: Common Threads in Communications","author":"S. Sakata","year":"1998","unstructured":"Sakata, S., The BM Algorithm and the BMS Algorithm, Codes, Curves, and Signals: Common Threads in Communications, Vardy, A., Ed., Boston: Kluwer, 1998, pp. 39\u201352."},{"issue":"11","key":"4107_CR18","doi-asserted-by":"publisher","first-page":"2905","DOI":"10.1109\/TIT.2004.836670","volume":"50","author":"L.-P. Wang","year":"2004","unstructured":"Wang, L.-P., Zhu, Y.-F., and Pei, D.-Y., On the Lattice Basis Reduction Multisequence Synthesis Algorithm, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 11, pp. 2905\u20132910.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4107_CR19","first-page":"38","volume":"35","author":"V.L. Kurakin","year":"1999","unstructured":"Kurakin, V.L., The Berlekamp-Massey Algorithm over a Finite Commutative Ring, Probl. Peredachi Inf., 1999, vol. 35, no. 2, pp. 38\u201350 [Probl. Inf. Trans. (Engl. Transl.), 1999, vol. 35, no. 2, pp. 125\u2013135].","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"4107_CR20","doi-asserted-by":"publisher","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, Systems Control Lett., 1997, vol. 31, no. 4, pp. 225\u2013233.","journal-title":"Systems Control Lett."},{"key":"4107_CR21","doi-asserted-by":"crossref","unstructured":"Schmidt, G. and Sidorenko, V.R., Multi-Sequence Linear Shift-Register Synthesis: The Varying Length Case, in Proc. 2006 IEEE Int. Sympos. on Information Theory (ISIT\u20192006), Seattle, USA, 2006, pp. 1738\u20131742.","DOI":"10.1109\/ISIT.2006.261652"},{"key":"4107_CR22","unstructured":"Schmidt, G. and Sidorenko, V.R., Linear Shift-Register Synthesis for Multiple Sequences of Varying Length, arXiv e-print cs.IT\/0605044, 2006."},{"key":"4107_CR23","volume-title":"Algebraic Decoding beyond Half the Minimum Distance Based on Shift-Register Synthesis","author":"G. Schmidt","year":"2007","unstructured":"Schmidt, G., Algebraic Decoding beyond Half the Minimum Distance Based on Shift-Register Synthesis, D\u00fcsseldorf: VDI, 2007."},{"key":"4107_CR24","doi-asserted-by":"crossref","unstructured":"Wang, L.P., Wang, Q.L., and Wang, K.P., A Lattice-Based Shift-Register Synthesis for Multi-Sequences of Varying Length, in Proc. 2008 IEEE Int. Sympos. on Information Theory (ISIT\u20192008), Toronto, Canada, 2008, pp. 1751\u20131754.","DOI":"10.1109\/ISIT.2008.4595288"},{"key":"4107_CR25","unstructured":"Wang, Z. and Zhou, J., An Synthesis Algorithm of Minimum Generating Polynomial of Several Sequences, J. Graduate School Chinese Acad. Sci., 1988, no. 1, pp. 20\u201327."},{"key":"4107_CR26","unstructured":"Sidorenko, V., Richter, G., and Bossert, M., Linearized Shift-Register Synthesis, submitted to IEEE Trans. Inform. Theory."},{"issue":"2","key":"4107_CR27","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TIT.2010.2096032","volume":"57","author":"V. Sidorenko","year":"2011","unstructured":"Sidorenko, V., Lan, J., and Bossert, M., Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 2, pp. 621\u2013632.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011020062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946011020062","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011020062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011020062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:10:14Z","timestamp":1775009414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946011020062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["4107"],"URL":"https:\/\/doi.org\/10.1134\/s0032946011020062","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]},"assertion":[{"value":"31 March 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2010","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2011","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}