{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:53:28Z","timestamp":1725472408972},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540494621"},{"type":"electronic","value":"9783540494638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11935070_15","type":"book-chapter","created":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T07:25:27Z","timestamp":1163402727000},"page":"213-223","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)"],"prefix":"10.1007","author":[{"given":"Jianqin","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"R.A. Games","year":"1983","unstructured":"Games, R.A., Chan, A.H.: A fast algorithm for determining the complexity of a binary sequence with period 2\n                    n\n                  . IEEE Trans on Information Theory\u00a029(1), 144\u2013146 (1983)","journal-title":"IEEE Trans on Information Theory"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-54973-0","volume-title":"The Stability Theory of Stream Ciphers","author":"C.S. Ding","year":"1991","unstructured":"Ding, C.S., Xiao, G.Z., Shan, W.J.: The Stability Theory of Stream Ciphers, pp. 85\u201388. Springer, Heidelberg (1991)"},{"issue":"5","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1702","DOI":"10.1109\/18.333898","volume":"40","author":"S.R. Blackburn","year":"1994","unstructured":"Blackburn, S.R.: A generalization of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence. IEEE Trans on Information Theory\u00a040(5), 1702\u20131704 (1994)","journal-title":"IEEE Trans on Information Theory"},{"issue":"12","key":"15_CR4","first-page":"48","volume":"22","author":"S.M. Wei","year":"2001","unstructured":"Wei, S.M., Xiao, G.Z., Chen, Z.: Fast algorithms for determining the linear complexity of periodic sequences. Journal of China Institute of Communications\u00a022(12), 48\u201354 (2001) (in Chinese)","journal-title":"Journal of China Institute of Communications"},{"issue":"3","key":"15_CR5","first-page":"401","volume":"32","author":"S.M. Wei","year":"2002","unstructured":"Wei, S.M., Xiao, G.Z., Chen, Z.: A fast algorithm for determining the complexity of a binary sequence with period 2\n                    n\n                  \n                           p\n                           \n                    m\n                  . Science in China (Series F)\u00a032(3), 401\u2013408 (2002)","journal-title":"Science in China (Series F)"},{"issue":"10","key":"15_CR6","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1109\/TIT.2002.802609","volume":"48","author":"S.M. Wei","year":"2002","unstructured":"Wei, S.M., Xiao, G.Z., Chen, Z.: A fast algorithm for determining the minimal polynomial of a sequence with period 2p\n                           \n                    n\n                   over GF(q). IEEE Trans. on Information Theory\u00a048(10), 2754\u20132758 (2002)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"122","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. on Information Theory\u00a015(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. on Information Theory"},{"key":"15_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"R.J. McEliece","year":"1987","unstructured":"McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic Publishers, Boston (1987)"},{"key":"15_CR9","volume-title":"Elementary Number Theory and its Applications","author":"K.H. Rosen","year":"1988","unstructured":"Rosen, K.H.: Elementary Number Theory and its Applications. Addison-Wesley, Reading (1988)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11935070_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:47:52Z","timestamp":1619509672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11935070_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540494621","9783540494638"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11935070_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}