{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T13:07:46Z","timestamp":1688303266524},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci China Ser F"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1007\/bf02713949","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T16:33:08Z","timestamp":1654014788000},"page":"453-460","source":"Crossref","is-referenced-by-count":1,"title":["A fast algorithm for determining the linear complexity of a binary sequence with period 2\n                n\n              \n              p\n              \n                m"],"prefix":"10.1007","volume":"44","author":[{"given":"Shimin","family":"Wei","sequence":"first","affiliation":[]},{"given":"Guozhen","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Zhong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"BF02713949_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, 1983, 29(1): 144\u2013146.","journal-title":"IEEE Trans on Information Theory"},{"key":"BF02713949_CR2","doi-asserted-by":"crossref","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, Berlin\/Heidelberg: Springer-Verlag, 1991."},{"key":"BF02713949_CR3","volume-title":"Fast algorithms for computing the Boolean polynomial and the linear complexity of periodic sequences, Advances in Cryptography-Chinacrypt\u201992","author":"X. D. Ling","year":"1992","unstructured":"Ling, X. D., Hu, Z. M., Cai, C. N., Fast algorithms for computing the Boolean polynomial and the linear complexity of periodic sequences, Advances in Cryptography-Chinacrypt\u201992 (in Chinese), Beijing: Science Press, 1992."},{"issue":"5","key":"BF02713949_CR4","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 generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence, IEEE Trans on Information Theory, 1994, 40(5): 1702\u20131704.","journal-title":"IEEE Trans on Information Theory"},{"issue":"8","key":"BF02713949_CR5","first-page":"36","volume":"20","author":"Shimin Wei","year":"1999","unstructured":"Wei Shimin, Bai Guoqiang, Xiao Guozhen, A fast algorithm for determining the linear complexity of a binary sequence with periodp\n                  \n                    n\n                  , Journal of Chinese Communications (in Chinese), 1999, 20(8): 36\u201340.","journal-title":"Journal of Chinese Communications"},{"key":"BF02713949_CR6","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, Boston: Kluwer Academic Publishers, 1987."},{"key":"BF02713949_CR7","volume-title":"Elementary Number Theory and Its Applications","author":"K. H. Rosen","year":"1988","unstructured":"Rosen, K. H., Elementary Number Theory and Its Applications, Reading: Addison-Wesley, 1988."},{"issue":"1","key":"BF02713949_CR8","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, 1969, 15(1): 122\u2013127.","journal-title":"IEEE Trans. on Information Theory"}],"container-title":["Science in China Series F Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02713949.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02713949\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02713949.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T16:33:15Z","timestamp":1654014795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02713949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["BF02713949"],"URL":"https:\/\/doi.org\/10.1007\/bf02713949","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}