{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:12:34Z","timestamp":1740460354251,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,12]],"date-time":"2010-08-12T00:00:00Z","timestamp":1281571200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s12095-010-0037-8","type":"journal-article","created":{"date-parts":[[2010,8,11]],"date-time":"2010-08-11T23:04:42Z","timestamp":1281567882000},"page":"29-42","source":"Crossref","is-referenced-by-count":1,"title":["A lattice-based minimal partial realization algorithm for matrix sequences of varying length"],"prefix":"10.1007","volume":"3","author":[{"given":"Li-Ping","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,12]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/TAC.1986.1104191","volume":"31","author":"AC Antoulas","year":"1986","unstructured":"Antoulas, A.C.: On recursiveness and related topics in linear systems. IEEE Trans. Automat. Contr. 31, 1121\u20131135 (1986)","journal-title":"IEEE Trans. Automat. Contr."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Antoulas, A.C.: Recursive modeling of discrete-time time series. In: Van Dooren, P., Wyman, B. (eds.) Linear Algebra for Control Theory, IMA, vol. 62, pp.\u00a01\u201320 (1994)","DOI":"10.1007\/978-1-4613-8419-9_1"},{"key":"37_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0377-0427(00)00339-3","volume":"121","author":"A Bultheel","year":"2000","unstructured":"Bultheel, A., De Moor, B.: Rational approximation in linear systems and control. J. Comput. Appl. Math. 121, 355\u2013378 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"37_CR4","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, pp. 49\u201390. World Scientific, Singapore (2002)"},{"key":"37_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TAC.1974.1100457","volume":"19","author":"BW Dickinson","year":"1974","unstructured":"Dickinson, B.W., Morf, M., Kailath, D.: A minimal realization algorithm for matrix sequences. IEEE Trans. Automat. Contr. 19, 31\u201338 (1974)","journal-title":"IEEE Trans. Automat. Contr."},{"key":"37_CR6","first-page":"345","volume-title":"Advances in Cryptology. Lecture Notes in Computer Science, vol. 330","author":"CS Ding","year":"1988","unstructured":"Ding, C.S.: Proof of Massey\u2019s conjectured algorithm. In: Advances in Cryptology. Lecture Notes in Computer Science, vol. 330, pp.\u00a0345\u2013349. Springer, Berlin (1988)"},{"key":"37_CR7","unstructured":"ECRYPT stream cipher project. Report 2006\/060 (2006). Available at http:\/\/www.ecrypt.eu.org\/stream"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1109\/18.133246","volume":"37","author":"GL 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 37, 1274\u20131287 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"37_CR9","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0313029","volume":"13","author":"GD Forney","year":"1975","unstructured":"Forney, G.D.: Minimal bases of rational vector spaces, with applications to multivariable linear systems. SIAM J. Control 13, 493\u2013520 (1975)","journal-title":"SIAM J. Control"},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0024-3795(83)90059-9","volume":"50","author":"WB Gragg","year":"1983","unstructured":"Gragg, W.B., Lindquist, A.: On the partial realization problem. Linear Algebra Appl. 50, 277\u2013319 (1983)","journal-title":"Linear Algebra Appl."},{"key":"37_CR11","first-page":"303","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2000. Lecture Notes in Computer Science, vol. 1976","author":"P Hawkes","year":"2000","unstructured":"Hawkes, P., Rose, G.G.: Exploiting multiples of the connection polynomial in word-oriented stream ciphers. In: Okamoto, T. (ed.) Advances in Cryptology\u2014ASIACRYPT 2000. Lecture Notes in Computer Science, vol. 1976, pp. 303\u2013316. Springer, Berlin (2000)"},{"key":"37_CR12","unstructured":"Kalman, R.E.: On minimal partial realizations of a linear input\/output map. In: Aspects of Network and System Theory, pp. 385\u2013407. New York (1971)"},{"key":"37_CR13","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, 225\u2013233 (1997)","journal-title":"Syst. Control. Lett."},{"key":"37_CR14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0022-0000(85)90016-9","volume":"30","author":"AK Lenstra","year":"1985","unstructured":"Lenstra, A.K.: Factoring multivariate polynomials over finite fields. J. Comput. Syst. Sci. 30, 235\u2013248 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"37_CR15","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. 42, 488\u2013522 (1941)","journal-title":"Ann. Math."},{"key":"37_CR16","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"JL Massey","year":"1969","unstructured":"Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15, 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Schmidt, G., Sidorenko, V.R.: Multi-sequence linear shift-register synthesis: the varying length case. In: Proc. IEEE Intern. Symposium on Inform. Theory, pp. 1738\u20131742. Seatle, USA (2006)","DOI":"10.1109\/ISIT.2006.261652"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Schmidt, G., Sidorenko, V.R., Bossert, M.: Decoding Reed\u2013Solomon codes beyond half the minimum distance using shift-register synthesis. In: Proc. IEEE Intern. Symposium on Inform. Theory, pp. 459-463. Seatle, USA (2006)","DOI":"10.1109\/ISIT.2006.261711"},{"key":"37_CR19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0022-314X(91)90044-C","volume":"39","author":"WM Schmidt","year":"1991","unstructured":"Schmidt, W.M.: Construction and estimation of bases in function fields. J. Number Theory 39, 181\u2013224 (1991)","journal-title":"J. Number Theory"},{"key":"37_CR20","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, A.: A generalized minimal partial realization problem. Linear Algebra Appl. 254, 527\u2013551 (1997)","journal-title":"Linear Algebra Appl."},{"key":"37_CR21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02879339","volume":"44","author":"L-P Wang","year":"2001","unstructured":"Wang, L.-P., Zhu, Y.-F.: F[x]-lattice basis reduction algorithm and multisequence synthesis. Sci. China, Ser. F 44, 321\u2013328 (2001)","journal-title":"Sci. China, Ser. F"},{"key":"37_CR22","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. Inf. Theory 50, 2905\u20132910 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Wang, L.-P., Wang, Q.-L., Wang, K.-P.: A lattice-based linear shift register synthesis for multisequences of varying length. In: Proc. IEEE Intern. Symposium on Inform. Theory, pp. 1751\u20131754. Toronto, Canada (2008)","DOI":"10.1109\/ISIT.2008.4595288"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-010-0037-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-010-0037-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-010-0037-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:48:41Z","timestamp":1740376121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-010-0037-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["37"],"URL":"https:\/\/doi.org\/10.1007\/s12095-010-0037-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2010,8,12]]}}}