{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T08:31:42Z","timestamp":1722241902475},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T00:00:00Z","timestamp":1533772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00200-018-0368-9","type":"journal-article","created":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T11:15:44Z","timestamp":1533813344000},"page":"217-231","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A further study of the linear complexity of new binary cyclotomic sequence of length \n                \n                  \n                \n                $$p^r$$\n                \n                  \n                    \n                      p\n                      r"],"prefix":"10.1007","volume":"30","author":[{"given":"Zhifan","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinhui","family":"Ke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenhuang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"368_CR1","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1016\/j.ins.2006.10.010","volume":"177","author":"V Tomasevic","year":"2007","unstructured":"Tomasevic, V., Bojanic, S., Niteo-Taladriz, O.: Finding an internal state of RC4 stream cipher. Inf. Sci. 177, 1715\u20131727 (2007)","journal-title":"Inf. Sci."},{"key":"368_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546907","volume-title":"Signal Designs with Good Correlations: For Wireless Communications, Cryptography and Radar Applications","author":"G Golomb","year":"2005","unstructured":"Golomb, G., Gong, G.: Signal Designs with Good Correlations: For Wireless Communications, Cryptography and Radar Applications. Cambridge University Press, Cambridge (2005)"},{"issue":"1","key":"368_CR3","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. Theory 15(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"368_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-19368-5_2","volume-title":"Coding Theory and Applications","author":"JL Massey","year":"1988","unstructured":"Massey, J.L., Schaub, T.: Linear complexity in coding theory. In: Cohen, G., Godlewski, P.H. (eds.) Coding Theory and Applications. Lecture Notes in Computer Science, vol. 311, pp. 19\u201332. Springer, Heidelberg (1988)"},{"issue":"3","key":"368_CR5","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/18.669398","volume":"44","author":"C Ding","year":"1998","unstructured":"Ding, C., Hellseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44(3), 1276\u20131278 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"368_CR6","doi-asserted-by":"publisher","first-page":"3237","DOI":"10.1109\/TIT.2013.2237754","volume":"59","author":"XY Zeng","year":"2013","unstructured":"Zeng, X.Y., Cai, H., Tang, X.H., Yang, Y.: Optimal frequency hopping sequences of odd length. IEEE Trans. Inf. Theory 59(5), 3237\u20133248 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"368_CR7","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 \n                    \n                      \n                    \n                    $$p^2$$\n                    \n                      \n                        \n                          p\n                          2\n                        \n                      \n                    \n                  . Des. Codes Cryptogr. 86(7), 1483\u20131497 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"368_CR8","unstructured":"Edemskiy, V.: The linear complexity of new binary cyclotomic sequences of period \n                    \n                      \n                    \n                    $$p^n$$\n                    \n                      \n                        \n                          p\n                          n\n                        \n                      \n                    \n                  . \n                    arXiv:1712.03947"},{"issue":"9","key":"368_CR9","doi-asserted-by":"publisher","first-page":"092107:1","DOI":"10.1007\/s11432-014-5220-7","volume":"58","author":"ZX Chen","year":"2015","unstructured":"Chen, Z.X., Niu, Z.H., Wu, C.H.: On the k-error linear complexity of binary sequences derived from polynomial quotients. Sci. China Inf. Sci. 58(9), 092107:1\u2013092107:15 (2015)","journal-title":"Sci. China Inf. Sci."},{"issue":"6","key":"368_CR10","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00200-015-0265-4","volume":"26","author":"ZX Chen","year":"2015","unstructured":"Chen, Z.X., Du, X.N., Marzouk, R.: Trace representation of pseudorandom binary sequences derived from Euler quotients. Appl. Algebra Eng. Commun. Comput. 26(6), 555\u2013570 (2015)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"10","key":"368_CR11","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.1587\/transfun.E98.A.2199","volume":"98","author":"ZF Ye","year":"2015","unstructured":"Ye, Z.F., Ke, P.H., Zhang, S.Y., Chang, Z.L.: Some notes on pseudorandom binary sequences derived from Fermat-Euler quotients. IEICE Trans. Fundam. 98(10), 2199\u20132202 (2015)","journal-title":"IEICE Trans. Fundam."},{"key":"368_CR12","doi-asserted-by":"crossref","unstructured":"Ye, Z. F., Ke, P. H., Chen, Z. X.: Further results on pseudorandom binary sequences derived from Fermat-Euler quotients. In: 10th International Conference on Information, Communications and Signal Processing (ICICS), pp. 1\u20134 (2015)","DOI":"10.1109\/ICICS.2015.7459968"},{"issue":"4","key":"368_CR13","doi-asserted-by":"publisher","first-page":"743","DOI":"10.3934\/amc.2016038","volume":"10","author":"XN Du","year":"2016","unstructured":"Du, X.N., Wu, C.H., Wei, W.Y.: An extension of binary threshold sequence from Fermat quotient. Adv. Math. Commun. 10(4), 743\u2013752 (2016)","journal-title":"Adv. Math. Commun."},{"key":"368_CR14","unstructured":"Dorais, F. G., Klyve, D.: A Wieferich prime search up to \n                    \n                      \n                    \n                    $$6.7\\times 10^{15}$$\n                    \n                      \n                        \n                          6.7\n                          \u00d7\n                          \n                            10\n                            15\n                          \n                        \n                      \n                    \n                  . J. Integer Seq. 14(9) (2011). \n                    https:\/\/cs.uwaterloo.ca\/journals\/JIS\/VOL14\/Klyve\/klyve3.html\n                    \n                  . Accessed 20 Feb 2018"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-018-0368-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-018-0368-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-018-0368-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T19:13:47Z","timestamp":1565291627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-018-0368-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["368"],"URL":"https:\/\/doi.org\/10.1007\/s00200-018-0368-9","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,9]]},"assertion":[{"value":"8 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}