{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:55:08Z","timestamp":1742979308784,"version":"3.40.3"},"publisher-location":"New Delhi","reference-count":12,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132217671"},{"type":"electronic","value":"9788132217688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1768-8_21","type":"book-chapter","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T00:11:09Z","timestamp":1393891869000},"page":"225-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["1-Error Linear Complexity Test for Binary Sequences"],"prefix":"10.1007","author":[{"given":"Hetal G.","family":"Borisagar","sequence":"first","affiliation":[]},{"given":"Prasanna R.","family":"Mishra","sequence":"additional","affiliation":[]},{"given":"Navneet","family":"Gaba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,4]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"JL Massey","year":"1969","unstructured":"Massey, J.L.: Shift register synthesis and BCH decoding. IEEE Trans. Inf. Theor. 15(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/18.243455","volume":"39","author":"M Stamp","year":"1993","unstructured":"Stamp, M., Martin, C.F.: An algorithm for the k-error linear complexity of binary sequences with period 2\n                  n\n                . IEEE Trans. Inf. Theor. 39(4), 1398\u20131401 (1993)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"RA 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. Inf. Theor. 29(1), 144\u2013146 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1109\/TIT.2002.806136","volume":"49","author":"GB Lauder","year":"2003","unstructured":"Lauder, G.B., Paterson, K.G.: Computing the error linear complexity spectrum of a binary sequence of period 2\n                  n\n                . IEEE Trans. Inf. Theor. 49(1), 273\u20132803 (2003)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"21_CR5","volume-title":"The Stability Theory of Stream Ciphers","author":"C Ding","year":"1992","unstructured":"Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. Springer, Heidelberg (1992)"},{"doi-asserted-by":"crossref","unstructured":"Kaida, T., Uehara, S., Imamura, K.: An algorithm for the k-error linear complexity of sequences over GF(p\n                \n                  m\n                ) with period pn, p a prime. Inf. Comput. 151, 134\u2013147 (1999) Academic Press","key":"21_CR6","DOI":"10.1006\/inco.1998.2768"},{"doi-asserted-by":"crossref","unstructured":"Kaida, T.: On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences. In: Proceedings of SETA 2004, Volume LNCS 3486, pp. 166\u2013178. Spinger, Berlin (2005)","key":"21_CR7","DOI":"10.1007\/11423461_10"},{"issue":"4","key":"21_CR8","first-page":"221","volume":"8","author":"S Wei","year":"2008","unstructured":"Wei, S.: An efficient algorithm for determining the k-error linear complexity of binary sequences with periods 2p\n                \n                  n\n                . JCSNS Int. J. Comput. Sci. Netw. Sec. 8(4), 221 (2008)","journal-title":"JCSNS Int. J. Comput. Sci. Netw. Sec."},{"doi-asserted-by":"crossref","unstructured":"Alecu, A., Salagean, A.M.: A genetic algorithm for computing the k-error linear complexity of cryptographic sequences. In: 2007 IEEE Congress on Evolutionary Computation, pp. 3569\u20133576 (2007)","key":"21_CR9","DOI":"10.1109\/CEC.2007.4424935"},{"doi-asserted-by":"crossref","unstructured":"Zhou, J.: An algorithm for the k-error linear complexity of a sequence with period 2p\n                \n                  n\n                 over GF(q). In: IEEE Proceedings of IWSDA\u201907, pp. 104\u2013108 (2007)","key":"21_CR10","DOI":"10.1109\/IWSDA.2007.4408335"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1109\/TIT.2004.842769","volume":"51","author":"A Salagean","year":"2005","unstructured":"Salagean, A.: On the computation of the linear complexity and k-error linear complexity of binary sequences with period a power of two. IEEE Trans. Inf. Theor. 51(3), 1145\u20131150 (2005)","journal-title":"IEEE Trans. Inf. Theor."},{"doi-asserted-by":"crossref","unstructured":"Rukhin, A., et al.: A statistical test suite for random and psuedo random number generators for cryptographic applications. NIST Spec. Publ. 800\u2013822 (with revisions dated 15 May 2001)","key":"21_CR12","DOI":"10.6028\/NIST.SP.800-22"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Third International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1768-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T22:49:54Z","timestamp":1675810194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1768-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132217671","9788132217688"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1768-8_21","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"4 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}