{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:24:49Z","timestamp":1725470689772},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540445234"},{"type":"electronic","value":"9783540445241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11863854_3","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T04:27:22Z","timestamp":1158640042000},"page":"17-33","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Continued Fraction Algorithms and Their Applications to Sequences"],"prefix":"10.1007","author":[{"given":"Zongduo","family":"Dai","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"173","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. Information Theory\u00a015, 173\u2013180 (1969)","journal-title":"IEEE Trans. Information Theory"},{"issue":"129","key":"3_CR2","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. Computation\u00a029(129), 173\u2013180 (1975)","journal-title":"Math. Computation"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1006\/jnth.1997.2160","volume":"65","author":"A. Lasjaunias","year":"1997","unstructured":"Lasjaunias, A.: Diophantine approximation and continued fraction expansions of algebraic power series in positive characteristic. J. Number Theorey\u00a065, 206\u2013225 (1997)","journal-title":"J. Number Theorey"},{"key":"3_CR4","unstructured":"Jones, W.B., Thron, W.J.: Continued fractions, analytic theory and applications. In: Rota, G. (ed.) Encyclopedia of Mathematics and Its Applications, vol.\u00a011"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.4064\/aa-95-2-139-166","volume":"95","author":"W.M. Schmidt","year":"2000","unstructured":"Schmidt, W.M.: On continued fraction and diophantine approximation in power series fields. Acta Arith.\u00a095, 139\u2013166 (2000)","journal-title":"Acta Arith."},{"key":"3_CR6","volume-title":"LNM207","author":"L. Bernstein","year":"1971","unstructured":"Bernstein, L.: The Jacobi-Perron algorithm: its theory and application. In: LNM207. Springer, Berlin (1971)"},{"key":"3_CR7","first-page":"184","volume":"4","author":"E.V. Podsypanin","year":"1977","unstructured":"Podsypanin, E.V.: A generalization of continued fraction alogrithm that is related to ViggoBorun algorithm (Russian). Studies in Number Theory (LOMI), Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov 67\u00a04, 184\u2013194 (1977)","journal-title":"Studies in Number Theory (LOMI), Zap. Naucn. Sem. Leningrad. Otdel. Mat. Inst. Steklov 67"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1017\/S0143385700007380","volume":"13","author":"S. Ito","year":"1993","unstructured":"Ito, S., Keane, M., Ohtsuki, M.: Almost everywhere exponential convergence of the modified Jocobi-Perron algorithm. Ergod.Th. & Dynam. Sys.\u00a013, 319\u2013334 (1993)","journal-title":"Ergod.Th. & Dynam. Sys."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0022-314X(02)00076-8","volume":"99","author":"S. Ito","year":"2003","unstructured":"Ito, S., Fujii, J., Higashino, H., Yasutomi, S.-I.: On simultaneous approximation to (\u03b1, \u03b1\n                           2) with \u03b1\n                           3\u2009+\u2009k\u03b1\u2212\u20091\u2009=\u20090. J. Number Theory\u00a099, 255\u2013283 (2003)","journal-title":"J. Number Theory"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1017\/S0143385799133960","volume":"19","author":"R. Meester","year":"1999","unstructured":"Meester, R.: A Simple proof of the exponential convergence of the modified Jacobi-Perron algorithm. Ergod.Th. &Dynam. Sys.\u00a019, 1077\u20131083 (1999)","journal-title":"Ergod.Th. &Dynam. Sys."},{"issue":"2","key":"3_CR11","first-page":"149","volume":"1","author":"K. Feng","year":"1994","unstructured":"Feng, K., Wang, F.: The Jacobi-Perron algorithm on function fields. Algebra Colloq.\u00a01(2), 149\u2013158 (1994)","journal-title":"Algebra Colloq."},{"issue":"3","key":"3_CR12","first-page":"27","volume":"1","author":"K. Inoue","year":"2003","unstructured":"Inoue, K.: On the exponential convergence of Jacobi-Perron algorithm over F(x)\n                    d\n                  . JP Journal of Algebra, Number Theory and Application\u00a01(3), 27\u201341 (2003)","journal-title":"JP Journal of Algebra, Number Theory and Application"},{"issue":"2","key":"3_CR13","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. ADVANCE IN MATHEMATICS(CHINA)\u00a033(2), 246\u2013248 (2004)","journal-title":"ADVANCE IN MATHEMATICS(CHINA)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Dai, Z.D., Wang, K.P., Ye, D.F.: Multi-continued fraction algorithm on multi-formal Laurent Series. ACTA ARITHMETICA, 1\u201321 (2006)","DOI":"10.4064\/aa122-1-1"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"2911","DOI":"10.1109\/TIT.2004.836704","volume":"50","author":"Z.D. Dai","year":"2004","unstructured":"Dai, Z.D., Jiang, S.Q., Imamura, K., Gong, G.: Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences. IEEE Trans. Infor. Theory\u00a050, 2911\u20132915 (2004)","journal-title":"IEEE Trans. Infor. Theory"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/11423461_7","volume-title":"Sequences and Their Applications - SETA 2004","author":"Z.-D. Dai","year":"2005","unstructured":"Dai, Z.-D., Imamura, K., Yang, J.-H.: Asymptotic behavior of normalized linear complexity of multi-sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol.\u00a03486, pp. 129\u2013142. Springer, Heidelberg (2005)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11423461_25","volume-title":"Sequences and Their Applications - SETA 2004","author":"Z.-D. Dai","year":"2005","unstructured":"Dai, Z.-D., Feng, X., Yang, J.-H.: Multi-continued fraction algorithm and generalized B-M algorithm over F\n                           2. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol.\u00a03486, pp. 339\u2013354. Springer, Heidelberg (2005)"},{"key":"3_CR18","unstructured":"Dai, Z.D., Yang, J.H.: Multi-continued fraction algorithm and generalized B-M algorithm over F\n                           \n                    q\n                  . Finite Fields and Their Application (accepted)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1006\/jcom.2000.0560","volume":"16","author":"C. Xing","year":"2000","unstructured":"Xing, C.: Multi-sequences with almost perfect linear complexity profile and function fields over finite fields. Journal of Complexity\u00a016, 661\u2013675 (2000)","journal-title":"Journal of Complexity"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-1-4471-0551-0_5","volume-title":"Sequences and Their Applications","author":"H. Niederreiter","year":"1999","unstructured":"Niederreiter, H.: Some computable complexity measure for binary sequences. In: Sequences and Their Applications, pp. 67\u201378. Springer, London (1999)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Wang, L.P., Niederreiter, H.: Enumeration results on the joint linear complexity profile of multisequences, Finite Fields and Their Application, doi:10.1016\/j.ffa.2005.03.005","DOI":"10.1016\/j.ffa.2005.03.005"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11596219_2","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"H. Niederreiter","year":"2005","unstructured":"Niederreiter, H., Wang, L.-P.: Proof of a conjecture on the joint linear complexity profile of multisequences. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol.\u00a03797, pp. 13\u201322. Springer, Heidelberg (2005)"},{"issue":"2","key":"3_CR23","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.jco.2004.04.004","volume":"21","author":"X.T. Feng","year":"2005","unstructured":"Feng, X.T., Wang, Q.L., Dai, Z.D.: Multi-sequences with d-perfect property. Journal of Complexity\u00a021(2), 230\u2013242 (2005)","journal-title":"Journal of Complexity"},{"key":"3_CR24","first-page":"51","volume":"22","author":"Q.L. Dai","year":"2005","unstructured":"Dai, Q.L., Dai, Z.D.: A proof that JPA and MJPA on multi-formal Layrent series can not garrentee the optimal rational approximation. Journal of the Graduate School of the Chinese Academy of Science (in Chinese)\u00a022, 51\u201358 (2005)","journal-title":"Journal of the Graduate School of the Chinese Academy of Science (in Chinese)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/11423461_6","volume-title":"Sequences and Their Applications - SETA 2004","author":"X. Feng","year":"2005","unstructured":"Feng, X., Dai, Z.-D.: Expected value of the linear complexity of two-dimensional binary sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol.\u00a03486, pp. 113\u2013128. Springer, Heidelberg (2005)"},{"key":"3_CR26","unstructured":"Dai, Z.D., Feng, X.T.: Expected value of the normalized linear complexity of multi-sequences over the binary fields (preprint)"}],"container-title":["Lecture Notes in Computer Science","Sequences and Their Applications \u2013 SETA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11863854_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:21:04Z","timestamp":1619493664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11863854_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540445234","9783540445241"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11863854_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}