{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:12:47Z","timestamp":1773191567972,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T00:00:00Z","timestamp":1530057600000},"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":[[2019,5]]},"DOI":"10.1007\/s10623-018-0509-y","type":"journal-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T10:07:04Z","timestamp":1530094024000},"page":"1137-1160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials"],"prefix":"10.1007","volume":"87","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":[[2018,6,27]]},"reference":[{"key":"509_CR1","doi-asserted-by":"crossref","unstructured":"Broder A.: Generating random spanning trees. In: Proceedings of 30th Annual Symposium on Foundations of Computer Science, pp. 442\u2013447 (1989).","DOI":"10.1109\/SFCS.1989.63516"},{"issue":"7","key":"509_CR2","doi-asserted-by":"publisher","first-page":"4884","DOI":"10.1109\/TIT.2012.2191699","volume":"58","author":"AM Bruckstein","year":"2012","unstructured":"Bruckstein A.M., Etzion T., Giryes R., Gordon N., Holt R.J., Shuldiner D.: Simple and robust binary self-location patterns. IEEE Trans. Inf. Theory 58(7), 4884\u20134889 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"509_CR3","doi-asserted-by":"publisher","unstructured":"Chang Z., Ezerman M.F., Ling S., Wang H.: The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields. Cryptogr. Commun. (2017) (Online First 20 Dec 2017). \n                    https:\/\/doi.org\/10.1007\/s12095-017-0273-2\n                    \n                  .","DOI":"10.1007\/s12095-017-0273-2"},{"issue":"2","key":"509_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s12095-017-0219-8","volume":"10","author":"Z Chang","year":"2018","unstructured":"Chang Z., Ezerman M.F., Ling S., Wang H.: Construction of de Bruijn sequences from product of two irreducible polynomials. Cryptogr. Commun. 10(2), 251\u2013275 (2018).","journal-title":"Cryptogr. Commun."},{"key":"509_CR5","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":"Koninklijke Nederlandse Akademie v. Wetenschappen"},{"key":"509_CR6","doi-asserted-by":"publisher","DOI":"10.1142\/3254","volume-title":"Chinese Remainder Theorem: Applications in Computing, Coding Cryptography","author":"C Ding","year":"1996","unstructured":"Ding C., Pei D., Salomaa A.: Chinese Remainder Theorem: Applications in Computing, Coding Cryptography. World Scientific Publishing, River Edge (1996)."},{"issue":"3","key":"509_CR7","doi-asserted-by":"publisher","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. Inf. Theory 30(3), 480\u2013484 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"509_CR8","unstructured":"Ezerman M.F., Fahreza A.A.: A binary de Bruijn sequence generator from product of irreducible polynomials. \n                    https:\/\/www.github.com\/adamasstokhorst\/debruijn\n                    \n                  ."},{"issue":"2","key":"509_CR9","doi-asserted-by":"publisher","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. Combin. Theory Ser. A 19(2), 192\u2013199 (1975).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"509_CR10","doi-asserted-by":"publisher","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":"509_CR11","volume-title":"Shift Register Sequences","author":"SW Golomb","year":"1981","unstructured":"Golomb S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1981)."},{"key":"509_CR12","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\u20133","key":"509_CR13","doi-asserted-by":"publisher","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. Discret. Math. 159(1\u20133), 143\u2013154 (1996).","journal-title":"Discret. Math."},{"issue":"13","key":"509_CR14","doi-asserted-by":"publisher","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. Discret. Math. 148(13), 65\u201383 (1996).","journal-title":"Discret. Math."},{"issue":"7","key":"509_CR15","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1109\/TC.1984.5009342","volume":"33","author":"F Hemmati","year":"1984","unstructured":"Hemmati F., Schilling D.L., Eichmann G.: Adjacencies between the cycles of a shift register with characteristic polynomial \n                    \n                      \n                    \n                    $$(1+x)^{n}$$\n                    \n                      \n                        \n                          \n                            (\n                            1\n                            +\n                            x\n                            )\n                          \n                          n\n                        \n                      \n                    \n                  . IEEE Trans. Comput. 33(7), 675\u2013677 (1984).","journal-title":"IEEE Trans. Comput."},{"key":"509_CR16","unstructured":"Knuth D.E.: Grayspspan. \n                    http:\/\/www-cs-faculty.stanford.edu\/~uno\/programs\/grayspspan.w\n                    \n                  ."},{"key":"509_CR17","unstructured":"Knuth D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley\/Longman Publishing, Boston (1997)."},{"key":"509_CR18","unstructured":"Knuth D.E.: The Art of Computer Programming, vol. 4A, Combinatorial Algorithms. Part 1. Addison-Wesley, Upple Saddle River (2011)."},{"issue":"2","key":"509_CR19","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/18.825845","volume":"46","author":"K Kurosawa","year":"2000","unstructured":"Kurosawa K., Sato F., Sakata T., Kishimoto W.: A relationship between linear complexity and k-error linear complexity. IEEE Trans. Inf. Theory 46(2), 694\u2013698 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"509_CR20","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TIT.2016.2634420","volume":"63","author":"M Li","year":"2017","unstructured":"Li M., Lin D.: The adjacency graphs of LFSRs with primitive-like characteristic polynomials. IEEE Trans. Inf. Theory 63(2), 1325\u20131335 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"509_CR21","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1109\/TIT.2017.2787742","volume":"64","author":"M Li","year":"2018","unstructured":"Li M., Lin D.: De Bruijn sequences, adjacency graphs and cyclotomy. IEEE Trans. Inf. Theory 64(4), 2941\u20132952 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"509_CR22","doi-asserted-by":"publisher","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. Inf. Theory 60(5), 3052\u20133061 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"509_CR23","doi-asserted-by":"publisher","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. Inf. Theory 60(12), 7955\u20137969 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"509_CR24","doi-asserted-by":"publisher","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. Inf. Theory 62(1), 610\u2013624 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"509_CR25","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10623-016-0187-6","volume":"82","author":"M Li","year":"2017","unstructured":"Li M., Jiang Y., Lin D.: The adjacency graphs of some feedback shift registers. Des. Codes Cryptogr. 82(3), 695\u2013713 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"509_CR26","series-title":"Encyclopaedia of Mathematics and Its Applications","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Encyclopaedia of Mathematics and Its ApplicationsCambridge University Press, New York (1997)."},{"key":"509_CR27","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes A.J., Vanstone S.A., Oorschot P.C.V.: Handbook of Applied Cryptography, 1st edn. CRC Press, Boca Raton (1996).","edition":"1"},{"issue":"1","key":"509_CR28","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/0095-8956(72)90006-8","volume":"13","author":"J Mykkeltveit","year":"1972","unstructured":"Mykkeltveit J.: A proof of Golomb\u2019s conjecture for the de Bruijn graph. J. Combin. Theory Ser. B 13(1), 40\u201345 (1972).","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"509_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1038\/nrg3367","volume":"14","author":"N Nagarajan","year":"2013","unstructured":"Nagarajan N., Pop M.: Sequence assembly demystified. Nat. Rev. Genet. 14(3), 157\u2013167 (2013).","journal-title":"Nat. Rev. Genet."},{"issue":"3","key":"509_CR30","first-page":"131","volume":"55","author":"A Ralston","year":"1982","unstructured":"Ralston A.: De Bruijn sequences\u2014a model example of the interaction of discrete mathematics and computer science. Math. Mag. 55(3), 131\u2013143 (1982).","journal-title":"Math. Mag."},{"issue":"11","key":"509_CR31","doi-asserted-by":"publisher","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 Trans. Aerosp. Electron. Syst. 28(11), 28\u201339 (2013).","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"509_CR32","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"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0509-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0509-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0509-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T19:10:17Z","timestamp":1561576217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0509-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["509"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0509-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,27]]},"assertion":[{"value":"31 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}