{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:45:19Z","timestamp":1649029519476},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T00:00:00Z","timestamp":1447200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11432-015-5302-1","type":"journal-article","created":{"date-parts":[[2015,11,12]],"date-time":"2015-11-12T15:07:35Z","timestamp":1447340855000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the matrix feedback shift register synthesis for matrix sequences"],"prefix":"10.1007","volume":"59","author":[{"given":"Liping","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,11]]},"reference":[{"key":"5302_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/9789812388841_0002","volume-title":"Coding Theory and Cryptology","author":"E Dawson","year":"2002","unstructured":"Dawson E, Simpson L. Analysis and design issues for synchronous stream ciphers. In: Niederreiter H, ed. Coding Theory and Cryptology. Singapore: World Scientific, 2002. 49\u201390"},{"key":"5302_CR2","first-page":"47","volume-title":"Proceedings of 9th Annual International Workshop on Selected Areas in Cryptography","author":"P Ekdahl","year":"2002","unstructured":"Ekdahl P, Johansson T. A new version of the stream ciphers SNOW. In: Proceedings of 9th Annual International Workshop on Selected Areas in Cryptography, Newfoundland, 2002. 47\u201361"},{"key":"5302_CR3","first-page":"303","volume-title":"Proceedings of 6th International Conference on the Theory and Application of Cryptology and Information Security","author":"P Hawkes","year":"2000","unstructured":"Hawkes P, Rose G G. Exploiting multiples of the connection polynomial in word-oriented stream ciphers. In: Proceedings of 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, 2000. 303\u2013316"},{"key":"5302_CR4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0024-3795(93)90247-L","volume":"192","author":"H Niederreiter","year":"1993","unstructured":"Niederreiter H. Factorization of polynomials and some linear algebra problems over finite fields. Linear Alg Appl, 1993, 192: 301\u2013328","journal-title":"Linear Alg Appl"},{"key":"5302_CR5","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1006\/ffta.2001.0339","volume":"8","author":"B Tsaban","year":"2002","unstructured":"Tsaban B, Vishne U. Efficient linear feedback shift registers with maximal period. Finite Fields Appl, 2002, 8: 256\u2013267","journal-title":"Finite Fields Appl"},{"key":"5302_CR6","volume-title":"Cryptology ePrint Archive","author":"G Zeng","year":"2007","unstructured":"Zeng G, Han W, He K. High efficiency feedback shift register: \u03c3-LFSR. Cryptology ePrint Archive, Report 2007\/114, 2007"},{"key":"5302_CR7","first-page":"359","volume":"50","author":"G Zeng","year":"2007","unstructured":"Zeng G, He K, Han W. A trinomial type of s-LFSR oriented toward software implementation. Sci China Ser-F: Inf Sci, 2007, 50: 359\u2013372","journal-title":"Sci China Ser-F: Inf Sci"},{"key":"5302_CR8","first-page":"127","volume-title":"Proceedings of 18th International Symposium on Applied Algebra","author":"G Zeng","year":"2009","unstructured":"Zeng G, Yang Y, Han W, et al. Word oriented cascade jump \u03c3-LFSR. In: Proceedings of 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Tarragona, 2009. 127\u2013136"},{"key":"5302_CR9","volume-title":"Algebraic Coding Theory","author":"E R Berlekamp","year":"1968","unstructured":"Berlekamp E R. Algebraic Coding Theory. New York: McGraw-Hill, 1968"},{"key":"5302_CR10","doi-asserted-by":"crossref","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, 15: 122\u2013127","journal-title":"IEEE Trans Inform Theory"},{"key":"5302_CR11","first-page":"246","volume":"33","author":"Z D Dai","year":"2004","unstructured":"Dai Z D, Wang K P, Ye D F. m-Continued fraction expansions of multi-Laurent series (in Chinese). Adv Math, 2004, 33: 246\u2013248","journal-title":"Adv Math"},{"key":"5302_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4064\/aa122-1-1","volume":"122","author":"Z D Dai","year":"2006","unstructured":"Dai Z D, Wang K P, Ye D F. Multi-continued fraction algorithm on multi-formal Laurent series. Acta Arithmet, 2006, 122: 1\u201316","journal-title":"Acta Arithmet"},{"key":"5302_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.ffa.2005.06.008","volume":"12","author":"Z D Dai","year":"2006","unstructured":"Dai Z D, Yang J H. Multi-continued fraction algorithm and generalized B-M algorithm over Fq. Finite Fields Appl, 2006, 12: 379\u2013402","journal-title":"Finite Fields Appl"},{"key":"5302_CR14","first-page":"345","volume-title":"Proceedings of Workshop on the Theory and Application of Cryptographic Techniques","author":"C S Ding","year":"1988","unstructured":"Ding C S. Proof of Massey\u2019s conjectured algorithm. In: Proceedings of Workshop on the Theory and Application of Cryptographic Techniques, Davos, 1988. 345\u2013349"},{"key":"5302_CR15","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1109\/18.133246","volume":"37","author":"G L Feng","year":"1991","unstructured":"Feng G L, 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, 37: 1274\u20131287","journal-title":"IEEE Trans Inform Theory"},{"key":"5302_CR16","doi-asserted-by":"crossref","first-page":"2905","DOI":"10.1109\/TIT.2004.836670","volume":"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 Inform Theory, 2004, 50: 2905\u20132910","journal-title":"IEEE Trans Inform Theory"},{"key":"5302_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/2500122","volume":"9","author":"F Kaltofen","year":"2013","unstructured":"Kaltofen F, Yuhasz G. On the matrix Berlekamp-Massey algorithm. ACM Trans Algorithm, 2013, 9: 33","journal-title":"ACM Trans Algorithm"},{"key":"5302_CR18","doi-asserted-by":"crossref","first-page":"2515","DOI":"10.1016\/j.laa.2013.06.016","volume":"439","author":"F Kaltofen","year":"2013","unstructured":"Kaltofen F, Yuhasz G. A fraction free matrix Berlekamp\/Massey algorithm. Linear Alg Appl, 2013, 439: 2515\u20132526","journal-title":"Linear Alg Appl"},{"key":"5302_CR19","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/TAC.1986.1104191","volume":"31","author":"A C Antoulas","year":"1985","unstructured":"Antoulas A C. On recursiveness and related topics in linear systems. IEEE Trans Automat Control, 1985, 31: 1121\u20131135","journal-title":"IEEE Trans Automat Control"},{"key":"5302_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TAC.1974.1100457","volume":"19","author":"B W Dickinson","year":"1974","unstructured":"Dickinson B W, Morf M, Kailath D. A minimal realization algorithm for matrix sequences. IEEE Trans Automat Control, 1974, 19: 31\u201338","journal-title":"IEEE Trans Automat Control"},{"key":"5302_CR21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0024-3795(83)90059-9","volume":"50","author":"W B Gragg","year":"1983","unstructured":"Gragg W B, Lindquist A. On the partial realization problem. Linear Alg Appl, 1983, 50: 277\u2013319","journal-title":"Linear Alg Appl"},{"key":"5302_CR22","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 Contr Lett, 1997, 31: 225\u2013233","journal-title":"Syst Contr Lett"},{"key":"5302_CR23","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/S0024-3795(96)00528-9","volume":"254","author":"M Barel van","year":"1997","unstructured":"van Barel M, Bultheel M A. A generalized minimal partial realization problem. Linear Alg Appl, 1997, 254: 527\u2013551","journal-title":"Linear Alg Appl"},{"key":"5302_CR24","first-page":"278","volume-title":"Proceedings of 5th International Conference on Sequences and Their Applications","author":"L P Wang","year":"2008","unstructured":"Wang L P. A lattice-based minimal partial realization algorithm. In: Proceedings of 5th International Conference on Sequences and Their Applications, Lexington, 2008. 278\u2013289"},{"key":"5302_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s12095-010-0037-8","volume":"3","author":"L P Wang","year":"2011","unstructured":"Wang L P. A lattice-based minimal partial realization algorithm for matrix sequences of varying length. Cryptogr Commun, 2011, 3: 29\u201342","journal-title":"Cryptogr Commun"},{"key":"5302_CR26","first-page":"3098","volume-title":"Proceedings of IEEE International Symposium on Information Theory","author":"L P Wang","year":"2012","unstructured":"Wang L P. Lagrange interpolation polynomials and generalized Reed-Solomon codes over rings of matrices. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2012. 3098\u20133100"},{"key":"5302_CR27","doi-asserted-by":"crossref","first-page":"5882","DOI":"10.1109\/TIT.2013.2264797","volume":"59","author":"G Quintin","year":"2013","unstructured":"Quintin G, Barbier M, Chabot C. On generalized Reed-Solomon codes over commutative and noncommutative rings. IEEE Trans Inform Theory, 2013, 59: 5882\u20135897","journal-title":"IEEE Trans Inform Theory"},{"key":"5302_CR28","first-page":"126","volume-title":"Proceeding of 3rd International Conference on Sequences and Their Applications","author":"Z D Dai","year":"2004","unstructured":"Dai Z D, Imamura K, Yang J H. Asymptotic behavior of normalized linear complexity of multi-sequences. In: Proceeding of 3rd International Conference on Sequences and Their Applications, Seoul, 2004. 126\u2013142"},{"key":"5302_CR29","first-page":"13","volume-title":"Proceeding of 6th International Conference on Cryptology in India","author":"H Niederreiter","year":"2005","unstructured":"Niederreiter H, Wang L P. Proof of a conjecture on the joint linear complexity profile of multisequences. In: Proceeding of 6th International Conference on Cryptology in India, Bangalore, 2005. 13\u201322"},{"key":"5302_CR30","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s00605-005-0392-2","volume":"150","author":"H Niederreiter","year":"2007","unstructured":"Niederreiter H, Wang L P. The asymptotic behavior of the joint linear complexity profile of multisequences. Monatsh Math, 2007, 150: 141\u2013155","journal-title":"Monatsh Math"},{"key":"5302_CR31","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s11432-011-4369-6","volume":"55","author":"H Niederreiter","year":"2012","unstructured":"Niederreiter H, Vielhaber M, Wang L P. Improved results on the probabilistic theory of the joint linear complexity of multisequences. Sci China Inf Sci, 2012, 55: 165\u2013170","journal-title":"Sci China Inf Sci"},{"key":"5302_CR32","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/j.ffa.2005.03.005","volume":"12","author":"L P Wang","year":"2006","unstructured":"Wang L P, Niederreiter H. Enumeration results on the joint linear complexity of multisequences. Finite Fields Appl, 2006, 12: 613\u2013637","journal-title":"Finite Fields Appl"},{"key":"5302_CR33","doi-asserted-by":"crossref","first-page":"488","DOI":"10.2307\/1968914","volume":"42","author":"K Mahler","year":"1941","unstructured":"Mahler K. An analogue to Minkowski\u2019s geometry of numbers in a field of series. Ann Math, 1941, 42: 488\u2013522","journal-title":"Ann Math"},{"key":"5302_CR34","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1090\/S0025-5718-99-01112-6","volume":"69","author":"R Couture","year":"2000","unstructured":"Couture R, L\u2019Ecuyer P. Lattice computations for random numbers. Math Comput, 2000, 69: 757\u2013765","journal-title":"Math Comput"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5302-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-015-5302-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5302-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:38:01Z","timestamp":1559403481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-015-5302-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,11]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["5302"],"URL":"https:\/\/doi.org\/10.1007\/s11432-015-5302-1","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,11]]},"article-number":"32107"}}