{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T22:22:35Z","timestamp":1755037355909,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T00:00:00Z","timestamp":1488931200000},"content-version":"unspecified","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":["U1304604"],"award-info":[{"award-number":["U1304604"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s12095-017-0219-8","type":"journal-article","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T09:12:55Z","timestamp":1488964375000},"page":"251-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Construction of de Bruijn sequences from product of two irreducible polynomials"],"prefix":"10.1007","volume":"10","author":[{"given":"Zuling","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5851-2717","authenticated-orcid":false,"given":"Martianus Frederic","family":"Ezerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,8]]},"reference":[{"key":"219_CR1","first-page":"203","volume":"28","author":"T Aardenne-Ehrenfest van","year":"1951","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Simon Stevin 28, 203\u2013217 (1951)","journal-title":"Simon Stevin"},{"key":"219_CR2","first-page":"758","volume":"49","author":"NG Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen 49, 758\u2013764 (1946)","journal-title":"Wetenschappen"},{"issue":"3","key":"219_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0097-3165(82)90038-3","volume":"33","author":"AH Chan","year":"1982","unstructured":"Chan, A.H., Games, R.A., Key, E.L.: On the complexities of de Bruijn sequences. J. Combinat. Theory, Ser. A 33(3), 233\u2013246 (1982)","journal-title":"J. Combinat. Theory, Ser. A"},{"key":"219_CR4","unstructured":"Chang, Z., Chrisnata, J., Ezerman, M.F., Kiah, H.M.: Rates of DNA sequence profiles for practical values of read lengths. CoRR abs\/1607.02279 (2016). arXiv:\n                        1607.02279"},{"key":"219_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/9283","volume-title":"Codes from Difference Sets","author":"C Ding","year":"2014","unstructured":"Ding, C.: Codes from Difference Sets. World Scientific, Singapore (2014)"},{"issue":"1","key":"219_CR6","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/TIT.2012.2214204","volume":"59","author":"E Dubrova","year":"2013","unstructured":"Dubrova, E.: A scalable method for constructing Galois NLFSRs with period 2\n                        n\n                    \u22121 using cross-join pairs. IEEE Trans. on Inform. Theory 59(1), 703\u2013709 (2013)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"3","key":"219_CR7","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1109\/TIT.1984.1056919","volume":"30","author":"T Etzion","year":"1984","unstructured":"Etzion, T., Lempel, A.: Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inform. Theory 30(3), 480\u2013484 (1984)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"219_CR8","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/S0097-3165(75)80007-0","volume":"19","author":"H Fredricksen","year":"1975","unstructured":"Fredricksen, H.: A class of nonlinear de Bruijn cycles. J. Combinat. Theory, Ser. A 19(2), 192\u2013199 (1975)","journal-title":"J. Combinat. Theory, Ser. A"},{"issue":"2","key":"219_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H Fredricksen","year":"1982","unstructured":"Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195\u2013221 (1982)","journal-title":"SIAM Rev."},{"key":"219_CR10","volume-title":"Shift Register Sequences","author":"SW Golomb","year":"1981","unstructured":"Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1981)"},{"key":"219_CR11","volume-title":"Signal Design for Good Correlation: for Wireless Communication, Cryptography, and Radar","author":"SW Golomb","year":"2004","unstructured":"Golomb, S.W., Gong, G.: Signal Design for Good Correlation: for Wireless Communication, Cryptography, and Radar. Cambridge University Press, New York (2004)"},{"issue":"1-3","key":"219_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0012-365X(96)00106-9","volume":"159","author":"ER Hauge","year":"1996","unstructured":"Hauge, E.R., Helleseth, T.: De Bruijn sequences, irreducible codes and cyclotomy. Discrete Math. 159(1-3), 143\u2013154 (1996)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"219_CR13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(94)00265-K","volume":"148","author":"ER Hauge","year":"1996","unstructured":"Hauge, E.R., Mykkeltveit, J.: On the classification of de Bruijn sequences. Discrete Math. 148(1\u20133), 65\u201383 (1996)","journal-title":"Discrete Math."},{"issue":"6","key":"219_CR14","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1109\/18.104342","volume":"37","author":"T Helleseth","year":"1991","unstructured":"Helleseth, T., Klove, T.: The number of cross-join pairs in maximum length linear sequences. IEEE Trans. on Inform. Theory 37(6), 1731\u20131733 (1991)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"5","key":"219_CR15","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1109\/18.133272","volume":"37","author":"CJA Jansen","year":"1991","unstructured":"Jansen, C.J.A., Franx, W.G., Boekee, D.E.: An efficient algorithm for the generation of de Bruijn cycles. IEEE Trans. on Inform. Theory 37(5), 1475\u20131478 (1991)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"5","key":"219_CR16","doi-asserted-by":"crossref","first-page":"3052","DOI":"10.1109\/TIT.2014.2310748","volume":"60","author":"C Li","year":"2014","unstructured":"Li, C., Zeng, X., Helleseth, T., Li, C., Hu, L.: The properties of a class of linear FSRs and their applications to the construction of nonlinear FSRs. IEEE Trans. Inform. Theory 60(5), 3052\u20133061 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"219_CR17","doi-asserted-by":"crossref","first-page":"7955","DOI":"10.1109\/TIT.2014.2361522","volume":"60","author":"C Li","year":"2014","unstructured":"Li, C., Zeng, X., Li, C., Helleseth, T.: A class of de Bruijn sequences. IEEE Trans. Inform. Theory 60(12), 7955\u20137969 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"219_CR18","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TIT.2015.2496946","volume":"62","author":"C Li","year":"2016","unstructured":"Li, C., Zeng, X., Li, C., Helleseth, T., Li, M.: Construction of de Bruijn sequences from LFSRs with reducible characteristic polynomials. IEEE Trans. Inform. Theory 62(1), 610\u2013624 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"219_CR19","volume-title":"Finite Fields. Encyclopaedia of Mathematics and Its Applications","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopaedia of Mathematics and Its Applications. Cambridge University Press, New York (1997)"},{"key":"219_CR20","first-page":"333","volume":"632","author":"J Mykkeltveit","year":"2015","unstructured":"Mykkeltveit, J., Szmidt, J.: On cross joining de Bruijn sequences. Contemporary Math. 632, 333\u2013344 (2015)","journal-title":"Contemporary Math."},{"key":"219_CR21","volume-title":"Elementary Methods in Number Theory. Graduate Texts in Mathematics","author":"M Nathanson","year":"2000","unstructured":"Nathanson, M.: Elementary Methods in Number Theory. Graduate Texts in Mathematics. Springer, New York (2000)"},{"issue":"17","key":"219_CR22","doi-asserted-by":"crossref","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. Natl. Acad. Sci. 98(17), 9748\u20139753 (2001)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"219_CR23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.2307\/2690079","volume":"55","author":"A Ralston","year":"1982","unstructured":"Ralston, A.: De Bruijn sequences - a model example of the interaction of discrete mathematics and computer science. Math. Mag. 55(3), 131\u2013143 (1982)","journal-title":"Math. Mag."},{"key":"219_CR24","unstructured":"Sloane, N.J.A.: The Online Encyclopedia of Integer Sequences. \n                        https:\/\/oeis.org"},{"issue":"11","key":"219_CR25","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MAES.2013.6678491","volume":"28","author":"S Spinsante","year":"2013","unstructured":"Spinsante, S., Gambi, E.: De Bruijn binary sequences and spread spectrum applications: A marriage possible? IEEE Aerosp. Electron. Syst. Mag. 28(11), 28\u201339 (2013)","journal-title":"IEEE Aerosp. Electron. Syst. Mag."},{"key":"219_CR26","volume-title":"Cyclotomy and Difference Sets. Lectures in Advanced Mathematics","author":"T Storer","year":"1967","unstructured":"Storer, T.: Cyclotomy and Difference Sets. Lectures in Advanced Mathematics. Markham Pub. Co., Chicago (1967)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-017-0219-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0219-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0219-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T02:35:22Z","timestamp":1518489322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-017-0219-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,8]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["219"],"URL":"https:\/\/doi.org\/10.1007\/s12095-017-0219-8","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2017,3,8]]}}}