{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:25:34Z","timestamp":1755033934618},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T00:00:00Z","timestamp":1409011200000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10623-014-0004-z","type":"journal-article","created":{"date-parts":[[2014,8,25]],"date-time":"2014-08-25T14:21:41Z","timestamp":1408976501000},"page":"255-275","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sequences with good correlation property based on depth and interleaving techniques"],"prefix":"10.1007","volume":"77","author":[{"given":"Min","family":"Zeng","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Guang","family":"Gong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,26]]},"reference":[{"key":"4_CR1","unstructured":"Abello J., Pardalos P.M., Resende, M.G.C.: On maximum clique problems in very large graphs. In: Abello J., Vitter J. (eds.) External Memory Algorithms. DIMACS Series on Discrete Mathematics and Theoretical Computer Science 50, pp. 119\u2013130. ISBN 0-8218-1184-3, American Mathematical Society, Providence (1999)."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda R., Etzion T., Moran S.: Rotating-table games and derivatives of words. Theor. Comput. Sci. 108, 311\u2013329 (1993).","DOI":"10.1016\/0304-3975(93)90196-Z"},{"key":"4_CR3","unstructured":"Brualdi R.A.: Introductory Combinatorics, 4th edition. China Machine Press, Beijing (2006)."},{"key":"4_CR4","unstructured":"Dai Z.: On the period of cycling matrix over $$F_q$$ F q . Acta Math. Sin. 23(1), 70\u201377 (1980)."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Ding C.: A fast algorithm for determining the linear complexity of sequences over $$GF(p^m)$$ G F ( p m ) with period $$p^n$$ p n . IEEE Trans. Inf. Theory 46(6), 2203\u20132206 (2000).","DOI":"10.1109\/18.868492"},{"key":"4_CR6","unstructured":"Ding C., Xiao G.: Stream Cryptography and Its Applications, pp. 39\u201371. National Defence Industry Press, Beijing (1994)."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Etzion T.: The depth distribution-a new characterization for linear codes. IEEE Trans. Inf. Theory 43(4), 1361\u20131363 (1997).","DOI":"10.1109\/18.605610"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Etzion T.: Linear complexity of de Bruijn sequences-old and new results. IEEE Trans. Inf. Theory 45(2), 693\u2013698 (1999).","DOI":"10.1109\/18.749013"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Games R.A.: Cross correlation of $$m$$ m -sequences and GMW-sequences with the same primitive polynomial. Discret. Appl. Math. 12, 139\u2013146 (1985).","DOI":"10.1016\/0166-218X(85)90067-8"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Games R.A., Chan A.H.: A fast algorithm for determining the complexity of a binary sequence with period $$2^n$$ 2 n . IEEE Trans. Inf. Theory 29(1), 144\u2013146 (1983).","DOI":"10.1109\/TIT.1983.1056619"},{"key":"4_CR11","unstructured":"Golomb S.W.: Shift Register Sequence. Aegen Park Press, Laguna Hills (1982)."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Golomb S.W., Gong G.: Signal Design for Good Correlation for Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005).","DOI":"10.1017\/CBO9780511546907"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Gong G.: Theory and applications of $$q$$ q -ary interleaved sequences. IEEE Trans. Inf. Theory 41(2), 400\u2013411 (1995).","DOI":"10.1109\/18.370141"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Gong G.: New designs for signal sets with low cross correlation, balance property, and large linear span: $$GF(p)$$ G F ( p ) case. IEEE Trans. Inf. Theory 48(11), 2847\u20132867 (2002).","DOI":"10.1109\/TIT.2002.804044"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Gong G., Helleseth T.: A three-valued Walsh transform from decimations of Helleseth\u2013Gong sequences. IEEE Trans. Inf. Theory 58(2), 1158\u20131162 (2012).","DOI":"10.1109\/TIT.2011.2169297"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Helleseth T., Kumar P.V., Martinson H.: A new family of ternary sequences with ideal two-level autocorrelation function. Des. Codes Cryptogr. 23(2), 157\u2013166 (2001).","DOI":"10.1023\/A:1011208514883"},{"key":"4_CR17","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1983)."},{"key":"4_CR18","unstructured":"Lin S., Costello D.J.: Error Control Coding: Fundamentals and Applications. Englewood Cliffs, Prentice-Hall (1983)."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Luo Y., Fu F., Wei V.K.: On the depth distribution of linear codes. IEEE Trans. Inf. Theory 46(6), 2197\u20132203 (2000).","DOI":"10.1109\/18.868491"},{"key":"4_CR20","unstructured":"MacWilliams F.J., Solane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, New York (1997)."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Mitchell C.J.: On integer-valued rational polynomials and depth distributions of binary codes. IEEE Trans. Inf. Theory 44(7), 3146\u20133150 (1998).","DOI":"10.1109\/18.737545"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Nathanson M.B.: Derivatives of binary sequences. SIAM J. Appl. Math. 21(3), 407\u2013412 (1971).","DOI":"10.1137\/0121043"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"No J.S., Yang K., Chung H., Song H.Y.: New construction for families of binary sequences with optimal correlation properties. IEEE Trans. Inf. Theory 43(5), 1596\u20131602 (1997).","DOI":"10.1109\/18.623156"},{"key":"4_CR24","unstructured":"Pollard J.M.: Monte Carlo methods for index computation (mod $$p$$ p ). Math. Comput. 32(143), 918\u2013924 (1978)."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Robshaw M.J.B.: On evaluating the linear complexity of a sequence of least period $$2^n$$ 2 n . Des. Codes Cryptogr. 4, 263\u2013269 (1994).","DOI":"10.1007\/BF01388455"},{"key":"4_CR26","unstructured":"Rosen K.H.: Elementary Number Theory and Its Applications, 4th edn, pp. 53\u201361, 222\u2013229. China Machine Press, Beijing (2004)."},{"key":"4_CR27","unstructured":"Roth R.M.: Private communication to Etzion T."},{"key":"4_CR28","unstructured":"Teske E.: Speeding Up Pollard\u2019s Rho Method for Computing Discrete Logarithms. Algorithmic Number Theory Seminar ANTS-III. Lecture Notes in Computer Science, vol. 1423, pp. 541\u2013554. Springer, Berlin (1998)."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Zeng M., Luo Y., Gong G.: Rotating-table game and construction of periodic sequences with lightweight calculation. In: Proceedings of the IEEE International Symposium of Information Theroy, Boston, MA, pp. 1\u20136 (2012).","DOI":"10.1109\/ISIT.2012.6283051"},{"key":"4_CR30","unstructured":"Zhang G., Zhou Q.: Pseudonoise codes constructed by Legendre sequence. Electron. Lett. 38(8), 376\u2013377 (2001)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0004-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-0004-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0004-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:37Z","timestamp":1559246317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-0004-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,26]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-0004-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,26]]}}}