{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:20Z","timestamp":1772283560007,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429111","type":"print"},{"value":"9783540456247","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45624-4_25","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"239-248","source":"Crossref","is-referenced-by-count":4,"title":["Euclidean Modules and Multisequence Synthesis"],"prefix":"10.1007","author":[{"given":"Liping","family":"Wang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"25_CR1","volume-title":"Algebraic Coding Theory","author":"E. R. Berlekamp","year":"1968","unstructured":"Berlekamp, E. R.: Algebraic Coding Theory. New York: McGrawHill (1968)"},{"key":"25_CR2","series-title":"Lect Notes Comput Sci","first-page":"88","volume-title":"An iterative Euclidean algorithm","author":"P. Camion","year":"1987","unstructured":"Camion, P.: An iterative Euclidean algorithm. LNCS 365 (1987) 88\u2013128."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TIT.1984.1056906","volume":"IT-30","author":"U. J. Cheng","year":"1984","unstructured":"Cheng, U. J.: On the continued fraction and Berlekamp\u2019s algorithm. IEEE Trans. Inform. Theory, vol. IT-30 (1984) 541\u2013544","journal-title":"IEEE Trans. Inform. Theory"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.1987.1057299","volume":"IT-33","author":"J. L. Dornstetter","year":"1987","unstructured":"Dornstetter, J. L.: On the equivalence between Berlekamp\u2019s algorithm and Euclid\u2019s algorithm. IEEE Trans. Inform. Theory, vol. IT-33 (1987) 428\u2013431","journal-title":"IEEE Trans. Inform. Theory"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1109\/18.30981","volume":"IT-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. Inform. Theory, vol. IT-35 (1989) 584\u2013594","journal-title":"IEEE Trans. Inform. Theory"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Hungerford, T. W.: Algebra, Springer-Verlag (1974)","DOI":"10.1007\/978-1-4612-6101-8_4"},{"key":"25_CR7","doi-asserted-by":"publisher","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. Inform. Theory, vol. IT-15 (1969) 122\u2013127","journal-title":"IEEE Trans. Inform. Theory"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.2307\/2005473","volume":"29","author":"W. H. Mills","year":"1975","unstructured":"Mills, W. H.: Continued fractions and linear recurrence. Math. Comp. vol. 29 (1975) 173\u2013180","journal-title":"Math. Comp"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/jsco.1995.1040","volume":"20","author":"G. H. Norton","year":"1995","unstructured":"Norton, G. H.: On the minimal realizations of a finite sequence. J. Symb. Comput. 20 (1995) 93\u2013115","journal-title":"J. Symb. Comput"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0022-314X(91)90044-C","volume":"39","author":"W. M. Schmidt","year":"1991","unstructured":"Schmidt, W. M.: Construction and estimation of bases in function fields. J. Number Theory 39 (1991) 181\u2013224","journal-title":"J. Number Theory"},{"key":"25_CR11","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., Namekawa, T.: A method for studying the key equation for decoding Goppa codes. Inform. Contr. vol. 27 (1975) 87\u201399","journal-title":"Inform. Contr"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Wang, L. P., Zhu, Y. F.: F[x]-lattice basis reduction algorithm and multisequence synthesis. Science in China, in press","DOI":"10.1109\/TIT.2004.836670"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Wang, L. P., Zhu, Y. F.: Multisequence synthesis over an integral ring. Cryptography and Lattices (2001) in press","DOI":"10.1007\/3-540-44670-2_15"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45624-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:30:44Z","timestamp":1556469044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}