{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T19:51:36Z","timestamp":1722023496330},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s11424-012-1101-6","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T07:47:58Z","timestamp":1356680878000},"page":"1223-1233","source":"Crossref","is-referenced-by-count":2,"title":["Distribution of one-error linear complexity of binary sequences for arbitrary prime period"],"prefix":"10.1007","volume":"25","author":[{"given":"Lin","family":"Tan","sequence":"first","affiliation":[]},{"given":"Wenfeng","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,29]]},"reference":[{"key":"1101_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Ciphers","author":"R. A. Rueppel","year":"1986","unstructured":"R. A. Rueppel, Analysis and Design of Stream Ciphers, Springer, Berlin, 1986."},{"issue":"1","key":"1101_CR2","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J. L. Massey","year":"1969","unstructured":"J. L. Massey, Shift register synthesis and BCH decoding, IEEE Trans. Inform. Theory, 1969, 15(1): 122\u2013127.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1101_CR3","doi-asserted-by":"crossref","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 2n, IEEE Trans. Inform. Theory, 1993, 39(4): 1398\u20131401.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1101_CR4","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54973-0","volume-title":"The Stability Theory of Stream Cipher","author":"C. Ding","year":"1991","unstructured":"C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Cipher, Springer, Berlin, LNCS 561, 1991."},{"issue":"11","key":"1101_CR5","doi-asserted-by":"crossref","first-page":"2817","DOI":"10.1109\/TIT.2002.804050","volume":"48","author":"W. Meidl","year":"2002","unstructured":"W. Meidl and H. Niederreiter, On the expected value of linear complexity and the k-error linear complexity of periodic sequences, IEEE Trans. Inform. Theory, 2002, 48(11): 2817\u20132825.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1101_CR6","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/TIT.2004.842709","volume":"51","author":"W. Meidl","year":"2005","unstructured":"W. Meidl, On the stablity of 2n-periodic binary sequences, IEEE Trans. Inform. Theory, 2005, 51(3): 1151\u20131155.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"1101_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10623-006-9029-2","volume":"42","author":"W. Meidl","year":"2007","unstructured":"W. Meidl and A. Vebkateswarlu, Remarks on the k-error linear complexity of p n-periodic sequences, Des. Codes Cryptogr., 2007, 42(2): 181\u2013193.","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1101_CR8","first-page":"256","volume":"17","author":"F. X. Zhu","year":"2008","unstructured":"F. X. Zhu and W. F. Qi, The 2-error linear complexity of 2n-periodic binary sequences, Chinese of Journal Electronics, 2008, 17(2): 256\u2013260.","journal-title":"Chinese of Journal Electronics"},{"issue":"1","key":"1101_CR9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"R. A. 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, 1983, 29(1): 144\u2013146.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"1101_CR10","doi-asserted-by":"crossref","first-page":"2203","DOI":"10.1109\/18.868492","volume":"46","author":"G. Z. Xiao","year":"2000","unstructured":"G. Z. Xiao, S. M. Wei, K. Y. Lam, and K. Imamura, A fast algorithm for determining the linear complexity of a sequence with period p n over GF(q), IEEE Trans. Inform. Theory, 2000, 46(6): 2203\u20132206.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"1101_CR11","doi-asserted-by":"crossref","first-page":"2297","DOI":"10.1109\/TIT.2007.896863","volume":"53","author":"Y. K. Han","year":"2007","unstructured":"Y. K. Han, J. Chung, and K. Yang, On the k-error linear complexity of p n-periodic binary sequences, IEEE Trans. Inform. Theory, 2007, 53(6): 2297\u20132304.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1101_CR12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jcom.2001.0621","volume":"18","author":"W. Meidl","year":"2002","unstructured":"W. Meidl and H. Niederreiter, Linear complexity, k-error linear complexity, and the discrete Fourier transform, J. Complexity, 2002, 18: 87\u2013103.","journal-title":"J. Complexity"},{"key":"1101_CR13","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"R. Lidl and H. Niedereiter, Finite Fields, Reading, MA: Addison-Wesley, 1983."},{"issue":"10","key":"1101_CR14","doi-asserted-by":"crossref","first-page":"4681","DOI":"10.1109\/TIT.2009.2027495","volume":"55","author":"T. Etzion","year":"2009","unstructured":"T. Etzion, N. Kalouptsidis, N. Kolokotronis, K. Limniotis, and K. Paterson, Properties of the error linear complexity spectrum, IEEE Trans. Inform. Theory, 2009, 55(10): 4681\u20134686.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1101_CR15","doi-asserted-by":"crossref","unstructured":"H. Niederreiter and I. E. Shparlinski, Periodic sequences with maximal linear complexity and almost maximal k-error linear complexity, Cryptography and Coding, Springer, Berlin, 2003, LNCS 2898: 183\u2013189.","DOI":"10.1007\/978-3-540-40974-8_15"},{"issue":"2","key":"1101_CR16","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TIT.2002.807308","volume":"49","author":"H. Niederreiter","year":"2003","unstructured":"H. Niederreiter, Periodic sequences with large k-error linear complexity, IEEE Trans. Inform. Theory, 2003, 49(2): 501\u2013505.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"1101_CR17","doi-asserted-by":"crossref","first-page":"4687","DOI":"10.1109\/TIT.2009.2027566","volume":"55","author":"H. G. Hu","year":"2009","unstructured":"H. G. Hu, G. Gong, and D. G. Feng, New results on Periodic sequences with large k-error linear complexity, IEEE Trans. Inform. Theory, 2009, 55(10): 4687\u20134694.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1101_CR18","doi-asserted-by":"crossref","unstructured":"F. W. Fu, H. Niederreiter, and M. Su, The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity, Sequences and Their Applications 2006, Springer, Berlin, 2006, LNCS 4086: 88\u2013103.","DOI":"10.1007\/11863854_8"},{"key":"1101_CR19","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-540-85912-3_23","volume-title":"Sequences and Their Applications 2008","author":"R. Kavuluru","year":"2008","unstructured":"R. Kavuluru, 2n-Periodic binary sequences with fixed k-error linear complexity for k = 2 or 3, Sequences and Their Applications 2008, Springer, Berlin, 2008, LNCS 5203: 252\u2013265."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-012-1101-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-012-1101-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-012-1101-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T17:19:17Z","timestamp":1562519957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-012-1101-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["1101"],"URL":"https:\/\/doi.org\/10.1007\/s11424-012-1101-6","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}