{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T04:43:29Z","timestamp":1745124209780},"publisher-location":"London","reference-count":15,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852331962"},{"type":"electronic","value":"9781447105510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-1-4471-0551-0_21","type":"book-chapter","created":{"date-parts":[[2011,8,26]],"date-time":"2011-08-26T04:46:19Z","timestamp":1314333979000},"page":"284-296","source":"Crossref","is-referenced-by-count":9,"title":["A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n"],"prefix":"10.1007","author":[{"given":"Takayasu","family":"Kaida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyoki","family":"Imamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT-15","author":"JL Massey","year":"1969","unstructured":"J.L. Massey,Shift register synthesis and BCH decoding,IEEE trans. Inform. Theory\n                IT-15 (1969),122\u2013127.","journal-title":"IEEE trans. Inform. Theory"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1090\/S0025-5718-1975-0369276-7","volume":"29","author":"WH Mills","year":"1975","unstructured":"W.H. Mills Continued fractions and linear recurrences Math. of Computation, 29 (1975), 173\u2013180.","journal-title":"Math. of Computation"},{"key":"21_CR3","first-page":"19","volume":"331","author":"JL Massey","year":"1986","unstructured":"J.L. Massey and T. Schaub Linear complexity in coding theory, Lecture Notes in Computer Science\n                331 (1986), 19\u201332.","journal-title":"Lecture Notes in Computer Science"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1109\/18.669427","volume":"44","author":"Z Dai","year":"1998","unstructured":"Z. Dai and K. Imamura, Linear complexity for one-symbol substitution of a periodic sequence over GF(q), IEEE pans. Inform. Theory\n                44 (1998), 1328\u20131331.","journal-title":"IEEE pans. Inform. Theory"},{"key":"21_CR5","first-page":"1739","volume":"E79-A","author":"S Uehara","year":"1996","unstructured":"S. Uehara and K. Imamura, Linear complexity of periodic sequences obtained from GF(q) sequences with period q\n                \n                  n\n                 -1 by one-symbol insertion, IEICE Trans. E79-A (1996), 1739\u20131740.","journal-title":"IEICE Trans"},{"key":"21_CR6","first-page":"1164","volume":"E80-A","author":"S Uehara","year":"1997","unstructured":"S. Uehara and K. Imamura, Linear complexity of periodic sequences obtained from a sequence over GF(p) with period pn - 1 by one-symbol deletion, IEICE Trans. E80-A (1997), 1164\u20131166.","journal-title":"IEICE Trans"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/18.243455","volume":"39","author":"M Stamp","year":"1993","unstructured":"M. Stamp and C.F. Martin, An algorithm for the k -error linear complexity of binary sequences with period 2\n                  n\n                \n                IEEE Trans. Inform. Theory\n                39 (1993), 1398\u20131401.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"21_CR8","volume-title":"Lecture Notes in Computer Science","author":"C Ding","year":"1991","unstructured":"C. Ding, G. Xiao and W. Shan \u201cThe Stability Theory of Stream Ciphers\u201d, Lecture Notes in Computer Science561 Springer-Verlag, 1991."},{"key":"21_CR9","series-title":"Proc. 1996 Int\u2019l Symp. Inform. Theory and Its Applications","first-page":"155","volume-title":"An algorithm for the k -error linear complexity of sequences over GF (3) with period 3 n","author":"T Kaida","year":"1996","unstructured":"T. Kaida, S. Uehara and K. Imamura, An algorithm for the k -error linear complexity of sequences over GF (3) with period 3\n                  n\n                , Proc. 1996 Int\u2019l Symp. Inform. Theory and Its Applications (1996), 155\u2013158."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/BFb0027791","volume-title":"Concurrency and Parallelism, Programming, Networking, and Security, Lecture Notes in Computer Science","author":"T Kaida","year":"1996","unstructured":"T. Kaida, S. Uehara and K. Imamura, Computation of the k -error linear complexity of binary sequences with period 2n, J. Jaffar and R.H.C. Yap (eds.), Concurrency and Parallelism, Programming, Networking, and Security, Lecture Notes in Computer Science 1179 (1996), 182\u2013191."},{"key":"21_CR11","volume-title":"An algorithm for the k -error linear complexity of sequences over GF(pm) with period p n , p an odd prime, submitted to Information and Computation","author":"T Kaida","year":"1999","unstructured":"T. Kaida, S. Uehara and K. Imamura, An algorithm for the k -error linear complexity of sequences over GF\n(p\n                \n                  m\n                ) with period p\n                  n\n                , p an odd prime, submitted to Information and Computation (1999)."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"IT-29","author":"RA Games","year":"1983","unstructured":"R.A. Games and A.H. Chan, A fast algorithm for determining the complexity of a binary sequence with period 2n, IEEE Trans. Inform. Theory\n                IT-29 (1983), 144\u2013146.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"21_CR13","first-page":"73","volume":"IT93\u201375","author":"K Imamura","year":"1993","unstructured":"K. Imamura and T. Moriuchi, A fast algorithm for determining the linear complexity of p-ary sequence with period pn, p a prime, IEICE Tech. Rept. IT93\u201375 (1993), 73\u201378 (in Japanese).","journal-title":"IEICE Tech. Rept"},{"key":"21_CR14","first-page":"920","volume":"E80-A","author":"S Uehara","year":"1997","unstructured":"S. Uehara, K. Imamura and T. Kaida, Value distribution of linear complexity for p-ary periodic sequences with period pn, p a prime, IEICE Trans. E80-A (1997), 920\u2013921.","journal-title":"IEICE Trans"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"1702","DOI":"10.1109\/18.333898","volume":"40","author":"SR Blackburn","year":"1994","unstructured":"S.R. Blackburn, A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence, IEEE Trans. Inform. Theory\n                40 (1994), 1702\u20131704.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Sequences and their Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0551-0_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T20:26:18Z","timestamp":1619814378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0551-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9781852331962","9781447105510"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0551-0_21","relation":{},"subject":[],"published":{"date-parts":[[1999]]}}}