{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:39Z","timestamp":1725487059863},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002635"},{"type":"electronic","value":"9783540362319"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36231-2_2","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T11:21:45Z","timestamp":1183375305000},"page":"12-21","source":"Crossref","is-referenced-by-count":3,"title":["Fast Algorithms for Determining the Linear Complexity of Period Sequences"],"prefix":"10.1007","author":[{"given":"Guozhen","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Shimin","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"2_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addision-Wesley, 1974."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1702","DOI":"10.1109\/18.333898","volume":"40","author":"S. R. Blackburn","year":"1994","unstructured":"S. R. Blackburn, \u201cA generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence\u201d, IEEE Trans. Inform. Theory, Vol. 40, pp. 1702\u20131704, 1994.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/18.556111","volume":"43","author":"S. R. Blackburn","year":"1997","unstructured":"S. R. Blackburn, \u201cFast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences\u201d, IEEE Trans. Inform. Theory, Vol. 43, pp. 537\u2013548, 1997.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54973-0","volume-title":"The stability theory of stream ciphers","author":"C. Ding","year":"1991","unstructured":"C. Ding, G. Xiao and W. Shan, The stability theory of stream ciphers, Springer-Verlag, Berlin Heidelberg, 1991."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"R. A. Games","year":"1983","unstructured":"R. A. Games, A. H. Chan, \u201cA fast algorithm for determining the complexity of a binary sequence with period 2n\u201d, IEEE Trans. Inform. Theory, vol. 29, pp. 144\u2013146, 1983.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR6","volume-title":"Graduate Texts in Mathematics","author":"K. Ireland","year":"1982","unstructured":"K. Ireland and M. Rosen, A classical introduction to modern number theory, Graduate Texts in Mathematics No. 84, Springer, New York, 1982."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1006\/inco.1998.2768","volume":"151","author":"T. Kaida","year":"1999","unstructured":"T. Kaida, S. Uehara and K. Imamura, \u201cAn algorithm for the k-error linear complexity of sequences over GF(p m) with period p n, p a prime\u201d, Information and Computation, Vol. 151, pp.134\u2013147, 1999.","journal-title":"Information and Computation"},{"key":"2_CR8","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley Publishing Company, 1983."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J. L. Massay","year":"1969","unstructured":"J. L. Massay, \u201cShift-register synthesis and BCH decoding\u201d, IEEE Trans. Inform. Theory, Vol. 15, pp. 122\u2013127, 1969.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"R. J. McEliece, Finite fields for computer scientists and engineers, Kluwer Academic Publishers, 1987.","DOI":"10.1007\/978-1-4613-1983-2"},{"key":"2_CR11","unstructured":"K. H. Rosen, Elementary number theory and its applications, Addison-Wesley Publishing Company, 1988."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/18.243455","volume":"39","author":"M. Stamp","year":"1993","unstructured":"M. Stamp, C. F. Martin, \u201cAn algorithm for k-error linear complexity of binary sequences with period 2 n\u201d, IEEE Trans on Inform. Theory, vol. 39, pp. 1398\u20131401, 1993.","journal-title":"IEEE Trans on Inform. Theory"},{"key":"2_CR13","unstructured":"S. Wei, An efficient algorithm for the linear complexity of a class of periodic sequences, Proceeding of ChinaCrypto\u20192002, Publishing House of Electronics Industry, Beijing, 2002."},{"key":"2_CR14","unstructured":"S. Wei, Z. Chen and G. Xiao, A fast algorithm for k-error linear complexity of a binary sequence. 2001 International Conferences on Info-tech and Info-net Proceedings, IEEE Press, 2001, No Conferences E, 152\u2013157."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"S. Wei, G. Xiao and Z. Chen, A Fast Algorithm for Determining the Minimal Polynomial of a Sequence with Period 2p n over GF(q) IEEE Trans. On Information Theory, 2002, 48(9). (to appear)","DOI":"10.1109\/TIT.2002.802609"},{"issue":"2","key":"2_CR16","first-page":"265","volume":"11","author":"S. Wei","year":"2002","unstructured":"S. Wei, G. Xiao and Z. Chen, An Efficient Algorithm for k-Error Linear Complexity. Chinese Journal of Electronics 2002 11( 2):265\u2013267.","journal-title":"Chinese Journal of Electronics"},{"issue":"6","key":"2_CR17","first-page":"453","volume":"44","author":"S. Wei","year":"2001","unstructured":"S. Wei, G. Xiao and Z. Chen, A fast algorithm for determining the linear complexity of a binary sequence with period 2npm, Science in China, Series F, 2001, 44(6):453\u2013460.","journal-title":"Science in China"},{"key":"2_CR18","unstructured":"G. Xiao, S. Wei, K. Imamura and K.Y. Lam, Algorithms for Determingning the Liner complexity Proceeding of International workshop on Cryptographic and-Commerce (CrypTEC\u201999), July 1999,Hong Kong, 31\u201336."},{"issue":"6","key":"2_CR19","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/18.868492","volume":"46","author":"G. Xiao","year":"2000","unstructured":"G. Xiao, S. Wei, K.Y. Lam, and K. Imamura, \u201cA fast algorithms for determining the linear complexity of a sequence with period p n over GF (q)\u201d, IEEE Trans. Inform. Theory, 2000, 46(6): 2203\u20132206.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014 INDOCRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36231-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:26:46Z","timestamp":1556573206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36231-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002635","9783540362319"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36231-2_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}