{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:43:25Z","timestamp":1763642605217,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:00:00Z","timestamp":1556928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571328"],"award-info":[{"award-number":["11571328"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Anhui Initiative in Quantum Information Technologies","award":["AHY150200"],"award-info":[{"award-number":["AHY150200"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10623-019-00638-5","type":"journal-article","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T13:00:23Z","timestamp":1557147623000},"page":"2585-2596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Linear complexity of generalized cyclotomic sequences of period $$2p^{m}$$"],"prefix":"10.1007","volume":"87","author":[{"given":"Yi","family":"Ouyang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1901-9548","authenticated-orcid":false,"given":"Xianhong","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,4]]},"reference":[{"issue":"5","key":"638_CR1","doi-asserted-by":"publisher","first-page":"1849","DOI":"10.1109\/TIT.2005.846450","volume":"51","author":"E Bai","year":"2005","unstructured":"Bai E., Liu X., Xiao G.: Linear complexity of new generalized cyclotomic sequences of order two of length $pq$. IEEE Trans. Inf. Theory 51(5), 1849\u20131853 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"638_CR2","doi-asserted-by":"publisher","first-page":"1520","DOI":"10.1002\/cpe.3052","volume":"26","author":"Z Chang","year":"2014","unstructured":"Chang Z., Li D.: On the linear complexity of generalized cyclotomic binary sequence of length $2pq$. Concurr. Comput. Pract. Exp. 26(8), 1520\u20131530 (2014).","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"638_CR3","first-page":"198","volume-title":"Stream Ciphers and Number Theory. North-Holland Mathematical Library","author":"T Cusick","year":"1998","unstructured":"Cusick T., Ding C., Renvall A.: Stream Ciphers and Number Theory. North-Holland Mathematical Library, vol. 55, pp. 198\u2013212. Elsevier, Amsterdam (1998)."},{"key":"638_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-60590-8_4","volume-title":"Fast Software Encryption. LNCS","author":"C Ding","year":"1995","unstructured":"Ding C.: Binary cyclotomic generators. Fast Software Encryption. LNCS, vol. 1008, pp. 29\u201360. Springer, Leuven (1995)."},{"key":"638_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/ffta.1997.0181","volume":"3","author":"C Ding","year":"1997","unstructured":"Ding C.: Linear complexity of generalized cyclotomic binary sequences of order $2$. Finite Fields Appl. 3, 159\u2013174 (1997).","journal-title":"Finite Fields Appl."},{"key":"638_CR6","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1006\/ffta.1998.0207","volume":"4","author":"C Ding","year":"1998","unstructured":"Ding C., Helleseth T.: New generalized cyclotomy and its applications. Finite Fields Appl. 4, 140\u2013166 (1998).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"638_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/18.748996","volume":"45","author":"C Ding","year":"1999","unstructured":"Ding C., Helleseth T.: Generalized cyclotomy codes of length $p_{1}^{m_{1}}p_{2}^{m_{2}}\\cdots p_{t}^{m_{t}}$. IEEE Trans. Inf. Theory 45(2), 467\u2013474 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"638_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10623-010-9474-9","volume":"61","author":"V Edemskiy","year":"2011","unstructured":"Edemskiy V.: About computation of the linear complexity of generalized cyclotomic sequences with period $p^{n+1}$. Des. Codes Cryptogr. 61, 251\u2013260 (2011).","journal-title":"Des. Codes Cryptogr."},{"key":"638_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0513-2","author":"V Edemskiy","year":"2018","unstructured":"Edemskiy V., Li C., Zeng X., Helleseth T.: The linear complexity of generalized cyclotomic binary cyclotomic sequences of period $p^{n}$. Des. Codes Cryptogr. (2018). \n                    https:\/\/doi.org\/10.1007\/s10623-018-0513-2\n                    \n                  .","journal-title":"Des. Codes Cryptogr."},{"key":"638_CR10","volume-title":"Shift register sequence","author":"SW Golomb","year":"1967","unstructured":"Golomb S.W.: Shift register sequence. Holden Day, San Francisco (1967)."},{"key":"638_CR11","doi-asserted-by":"publisher","first-page":"1702","DOI":"10.1109\/TIT.2010.2040887","volume":"56","author":"HG Hu","year":"2010","unstructured":"Hu H.G., Gong G.: New sets of zeros or low correlation zone sequences via interleaving technique. IEEE Trans. Inf. Theory 56, 1702\u20131713 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"638_CR12","doi-asserted-by":"publisher","first-page":"5534","DOI":"10.1109\/TIT.2012.2196254","volume":"58","author":"L Hu","year":"2012","unstructured":"Hu L., Yue Q., Wang M.: The linear complexity of Whiteman\u2019s generalized cyclotomic sequences of period $p^{m+1}q^{n+1}$. IEEE Trans. Inf. Theory 58, 5534\u20135543 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"638_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10623-012-9610-9","volume":"67","author":"PH Ke","year":"2013","unstructured":"Ke P.H., Zhang J., Zhang S.Y.: On the of linear complexity and the autocorrelation of generalized cyclotomic binary sequences with the period $2p^{m}$. Des. Codes Cryptogr. 67(3), 325\u2013339 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"638_CR14","unstructured":"Kim Y. J., Song H. Y.: Linear complexity of prime $n$-square sequences. In: IEEE International Symposium on Information Theory, Toronto, Canada, pp. 2405\u20132408 (2008)."},{"key":"638_CR15","first-page":"188","volume-title":"LNCS","author":"YJ Kim","year":"2007","unstructured":"Kim Y.J., Jin S.Y., Song H.Y.: Linear complexity and autocorrelation of prime cube sequences. LNCS, vol. 4851, pp. 188\u2013197. Springer, Berlin (2007)."},{"key":"638_CR16","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1587\/transfun.E98.A.1244","volume":"98A","author":"DD Li","year":"2015","unstructured":"Li D.D., Wen Q.Y.: Linear complexity of generalized cyclotomic binary sequences with period $2p^{m+1}q^{n+1}$. IEICE Trans. Fund. Electron. E 98A, 1244\u20131254 (2015).","journal-title":"IEICE Trans. Fund. Electron. E"},{"key":"638_CR17","first-page":"139","volume-title":"Sequences and Their Applications. LNCS","author":"F Liu","year":"2010","unstructured":"Liu F., Peng D.Y., Tang X.H.: On the autocorrelation and the linear complexity of $q$-ary prime $n$-square sequence. Sequences and Their Applications. LNCS, vol. 6338, pp. 139\u2013150. Springer, Berlin (2010)."},{"issue":"4","key":"638_CR18","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1142\/S0218196704001827","volume":"14","author":"YH Park","year":"2004","unstructured":"Park Y.H., Hong D., Chun E.: On the linear complexity of some generalized cyclotomic sequences. Int. J. Algebra Comput. 14(4), 431\u2013439 (2004).","journal-title":"Int. J. Algebra Comput."},{"issue":"1","key":"638_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1215\/ijm\/1255631810","volume":"6","author":"AL Whiteman","year":"1962","unstructured":"Whiteman A.L.: A family of difference sets. Illionis J. Math. 6(1), 107\u2013121 (1962).","journal-title":"Illionis J. Math."},{"key":"638_CR20","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1007\/s10623-017-0408-7","volume":"86","author":"ZB Xiao","year":"2018","unstructured":"Xiao Z.B., Zeng X.Y., Li C.L., Helleseth T.: New generalized cyclotomic binary sequences of period $p^{2}$. Des. Codes Cryptogr. 86, 1483\u20131497 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"638_CR21","doi-asserted-by":"publisher","first-page":"2049","DOI":"10.1587\/transfun.E96.A.2049","volume":"E96\u2013A 10","author":"T Yan","year":"2013","unstructured":"Yan T.: Some notes on the generalized cyclotomic binary sequences of length $2p^{m}$ and $p^{m}$. IEICE Trans. Fund. E96\u2013A 10, 2049\u20132051 (2013).","journal-title":"IEICE Trans. Fund."},{"key":"638_CR22","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1093\/ietfec\/e90-a.4.857","volume":"E90\u2013A","author":"T Yan","year":"2007","unstructured":"Yan T., Sun R., Xiao G.: Autocorrelation and linear complexity of the new generalized cyclotomic sequences. IEICE Trans. Fund. Electron. E90\u2013A, 857\u2013864 (2007).","journal-title":"IEICE Trans. Fund. Electron."},{"key":"638_CR23","unstructured":"Ye Z.F., Ke P.H., Wu C.H.: A further study on the linear complexity of new binary cyclotomic sequence of length $p^{r}$. arXiv:1712.08886V2 [cs.CR] 15 Mar 2018."},{"issue":"5","key":"638_CR24","doi-asserted-by":"publisher","first-page":"3237","DOI":"10.1109\/TIT.2013.2237754","volume":"59","author":"X Zeng","year":"2013","unstructured":"Zeng X., Cai H., Tang X., Yang Y.: Optimal frequency hopping sequences of odd length. IEEE Trans. Inf. Theory 59(5), 3237\u20133248 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"638_CR25","first-page":"93","volume-title":"Applicable Algebra in Engineering, Communication and Computing","author":"JW Zhang","year":"2010","unstructured":"Zhang J.W., Zhao C.A., Ma X.: Linear complexity of generalized cyclotomic binary sequences of length $2p^{m}$. Applicable Algebra in Engineering, Communication and Computing, vol. 21, pp. 93\u2013108. Springer, Berlin (2010)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00638-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00638-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00638-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,2]],"date-time":"2020-05-02T23:11:53Z","timestamp":1588461113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00638-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,4]]},"references-count":25,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["638"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00638-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,5,4]]},"assertion":[{"value":"6 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}