{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:40:15Z","timestamp":1778251215209,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772476"],"award-info":[{"award-number":["61772476"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s42979-021-00683-9","type":"journal-article","created":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T04:03:59Z","timestamp":1622606639000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Binary de Bruijn Sequences via Zech\u2019s Logarithms"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3282-6811","authenticated-orcid":false,"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2664-917X","authenticated-orcid":false,"given":"Adamas Aqsa","family":"Fahreza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1978-3557","authenticated-orcid":false,"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janusz","family":"Szmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7669-8922","authenticated-orcid":false,"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,2]]},"reference":[{"key":"683_CR1","first-page":"203","volume":"28","author":"T van Aardenne-Ehrenfest","year":"1951","unstructured":"van Aardenne-Ehrenfest T, de Bruijn NG. Circuits and trees in oriented linear graphs. Simon Stevin. 1951;28:203\u201317.","journal-title":"Simon Stevin."},{"key":"683_CR2","volume-title":"Matters computational: ideas, algorithms, source code","author":"J Arndt","year":"2010","unstructured":"Arndt J. Matters computational: ideas, algorithms, source code. 1st ed. New York: Springer; 2010.","edition":"1"},{"issue":"3\u20134","key":"683_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W, Cannon J, Playoust C. The Magma algebra system. I. The user language. J Symb Comput. 1997;24(3\u20134):235\u201365.","journal-title":"J Symb Comput."},{"key":"683_CR4","doi-asserted-by":"crossref","unstructured":"Broder A. Generating random spanning trees. In: 30th annual symposium on foundations of computer science, 1989; 1989. p. 442\u20137.","DOI":"10.1109\/SFCS.1989.63516"},{"key":"683_CR5","first-page":"758","volume":"49","author":"NG de Bruijn","year":"1946","unstructured":"de Bruijn NG. A combinatorial problem. Koninklijke Nederlandse Akademie v Wetenschappen. 1946;49:758\u201364.","journal-title":"Koninklijke Nederlandse Akademie v. Wetenschappen."},{"key":"683_CR6","doi-asserted-by":"publisher","unstructured":"Chang Z, Ezerman MF, Fahreza AA. On greedy algorithms for binary de Bruijn sequences. Appl Algebra Eng Commun. (2020) [Online]. https:\/\/doi.org\/10.1007\/s00200-020-00459-3","DOI":"10.1007\/s00200-020-00459-3"},{"issue":"5","key":"683_CR7","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/s10623-018-0509-y","volume":"87","author":"Z Chang","year":"2019","unstructured":"Chang Z, Ezerman MF, Ling S, Wang H. On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials. Des Codes Cryptogr. 2019;87(5):1137\u201360.","journal-title":"Des Codes Cryptogr."},{"issue":"11","key":"683_CR8","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1038\/nbt.2023","volume":"29","author":"P Compeau","year":"2011","unstructured":"Compeau P, Pevzner P, Tesler G. How to apply de Bruijn graphs to genome assembly. Nat Biotechnol. 2011;29(11):987\u201391.","journal-title":"Nat Biotechnol."},{"key":"683_CR9","unstructured":"Coppersmith D, Rhoades RC, VanderKam JM. Counting de Bruijn sequences as perturbations of linear recursions. CoRR. 2017. arXiv:1705.07835."},{"key":"683_CR10","doi-asserted-by":"publisher","DOI":"10.1142\/9283","volume-title":"Codes from difference sets","author":"C Ding","year":"2014","unstructured":"Ding C. Codes from difference sets. Singapore: World Scientific; 2014."},{"issue":"2","key":"683_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10623-016-0309-1","volume":"85","author":"J Dong","year":"2017","unstructured":"Dong J, Pei D. Construction for de Bruijn sequences with large stage. Des Codes Cryptogr. 2017;85(2):343\u201358.","journal-title":"Des Codes Cryptogr."},{"key":"683_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2018.03.006","volume":"72","author":"PB Dragon","year":"2018","unstructured":"Dragon PB, Hernandez OI, Sawada J, Williams A, Wong D. Constructing de Bruijn sequences with co-lexicographic order: the k-ary Grandmama sequence. Eur J Comb. 2018;72:1\u201311.","journal-title":"Eur J Comb."},{"issue":"1","key":"683_CR13","doi-asserted-by":"publisher","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-1$$ using cross-join pairs. IEEE Trans Inf Theory. 2013;59(1):703\u20139.","journal-title":"IEEE Trans Inf Theory."},{"issue":"3","key":"683_CR14","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. 1984;30(3):480\u20134.","journal-title":"IEEE Trans Inf Theory."},{"key":"683_CR15","unstructured":"Ezerman MF, Fahreza AA. A binary de Bruijn sequence generator from Zech\u2019s logarithms. 2017. https:\/\/github.com\/adamasstokhorst\/ZechdB."},{"key":"683_CR16","unstructured":"Ezerman MF, Fahreza AA. A binary de Bruijn sequence generator from product of irreducible polynomials. 2018. https:\/\/github.com\/adamasstokhorst\/debruijn."},{"issue":"2","key":"683_CR17","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 Comb Theory Ser A. 1975;19(2):192\u20139.","journal-title":"J Comb Theory Ser A."},{"issue":"2","key":"683_CR18","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. 1982;24(2):195\u2013221.","journal-title":"SIAM Rev."},{"key":"683_CR19","volume-title":"Shift register sequences","author":"SW Golomb","year":"1981","unstructured":"Golomb SW. Shift register sequences. Laguna Hills: Aegean Park Press; 1981."},{"key":"683_CR20","volume-title":"Signal design for good correlation: for wireless communication, cryptography, and radar","author":"SW Golomb","year":"2004","unstructured":"Golomb SW, Gong G. Signal design for good correlation: for wireless communication, cryptography, and radar. New York: Cambridge University Press; 2004."},{"issue":"1\u20133","key":"683_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0012-365X(96)00106-9","volume":"159","author":"ER Hauge","year":"1996","unstructured":"Hauge ER, Helleseth T. De Bruijn sequences, irreducible codes and cyclotomy. Discret Math. 1996;159(1\u20133):143\u201354.","journal-title":"Discret Math."},{"issue":"1\u20133","key":"683_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0012-365X(94)00265-K","volume":"148","author":"ER Hauge","year":"1996","unstructured":"Hauge ER, Mykkeltveit J. On the classification of de Bruijn sequences. Discret Math. 1996;148(1\u20133):65\u201383.","journal-title":"Discret Math."},{"issue":"6","key":"683_CR23","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1109\/18.104342","volume":"37","author":"T Helleseth","year":"1991","unstructured":"Helleseth T, Kl\u00f8ve T. The number of cross-join pairs in maximum length linear sequences. IEEE Trans Inf Theory. 1991;37(6):1731\u20133.","journal-title":"IEEE Trans Inf Theory."},{"issue":"1","key":"683_CR24","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/0196-6774(90)90028-D","volume":"11","author":"Y Huang","year":"1990","unstructured":"Huang Y. A new algorithm for the generation of binary de Bruijn sequences. J Algorithms. 1990;11(1):44\u201351.","journal-title":"J Algorithms."},{"issue":"4","key":"683_CR25","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1109\/18.53764","volume":"36","author":"K Huber","year":"1990","unstructured":"Huber K. Some comments on Zech\u2019s logarithms. IEEE Trans Inf Theory. 1990;36(4):946\u201350.","journal-title":"IEEE Trans Inf Theory."},{"issue":"D1","key":"683_CR26","doi-asserted-by":"publisher","first-page":"D117","DOI":"10.1093\/nar\/gku1045","volume":"43","author":"MA Hume","year":"2014","unstructured":"Hume MA, Barrera LA, Gisselbrecht SS, Bulyk ML. UniPROBE, update 2015: new tools and content for the online database of protein-binding microarray data on protein-DNA interactions. Nucleic Acids Res. 2014;43(D1):D117\u201322.","journal-title":"Nucleic Acids Res."},{"key":"683_CR27","first-page":"166","volume":"30","author":"C Jacobi","year":"1846","unstructured":"Jacobi C. \u00dcber die kreistheilung und ihre anwendung auf die zahlentheorie. J Reine Angew Math. 1846;30:166\u201382.","journal-title":"J Reine Angew Math."},{"issue":"5","key":"683_CR28","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/18.133272","volume":"37","author":"CJA Jansen","year":"1991","unstructured":"Jansen CJA, Franx WG, Boekee DE. An efficient algorithm for the generation of de Bruijn cycles. IEEE Trans Inf Theory. 1991;37(5):1475\u20138.","journal-title":"IEEE Trans Inf Theory."},{"key":"683_CR29","volume-title":"The art of computer programming. Combinatorial algorithms. Part 1","author":"DE Knuth","year":"2011","unstructured":"Knuth DE. The art of computer programming. Combinatorial algorithms. Part 1, vol. 4A. Upper Saddle River: Addison-Wesley; 2011."},{"issue":"12","key":"683_CR30","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/T-C.1970.222859","volume":"C-19","author":"A Lempel","year":"1970","unstructured":"Lempel A. On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers. IEEE Trans Comput. 1970;C-19(12):1204\u20139.","journal-title":"IEEE Trans Comput"},{"key":"683_CR31","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. New York: Cambridge University Press; 1997."},{"key":"683_CR32","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-35999-6_8","volume-title":"Selected areas in cryptography","author":"K Mandal","year":"2013","unstructured":"Mandal K, Gong G. Cryptographically strong de Bruijn sequences with large periods. In: Knudsen LR, Wu H, editors. Selected areas in cryptography. Berlin: Springer; 2013. p. 104\u201318."},{"key":"683_CR33","volume-title":"Handbook of applied cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes AJ, Vanstone SA, Oorschot PCV. Handbook of applied cryptography. 1st ed. Boca Raton: CRC Press Inc; 1996.","edition":"1"},{"key":"683_CR34","first-page":"333","volume":"632","author":"J Mykkeltveit","year":"2015","unstructured":"Mykkeltveit J, Szmidt J. On cross joining de Bruijn sequences. Contemp Math. 2015;632:333\u201344.","journal-title":"Contemp Math."},{"key":"683_CR35","volume-title":"New stream cipher designs","year":"2008","unstructured":"Robshaw M, Billet O, editors. New stream cipher designs. Berlin: Springer; 2008."},{"issue":"4","key":"683_CR36","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1109\/12.21149","volume":"38","author":"MR Samatham","year":"1989","unstructured":"Samatham MR, Pradhan DK. The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI. IEEE Trans Comput. 1989;38(4):567\u201381.","journal-title":"IEEE Trans Comput."},{"issue":"1","key":"683_CR37","first-page":"1","volume":"23","author":"J Sawada","year":"2016","unstructured":"Sawada J, Williams A, Wong D. Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles. Electron J Comb. 2016;23(1):1\u201324.","journal-title":"Electron J Comb."},{"key":"683_CR38","unstructured":"Sloane NJA. The online encyclopedia of integer sequences: Mersenne exponents, primes $$p$$ such that $$2^{p}-1$$ is (Mersenne) prime. https:\/\/oeis.org\/A000043."},{"key":"683_CR39","unstructured":"Sloane NJA. The online encyclopedia of integer sequences: triangle T read by rows. https:\/\/oeis.org\/A281123."},{"issue":"4","key":"683_CR40","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00224-013-9486-8","volume":"54","author":"B Stevens","year":"2014","unstructured":"Stevens B, Williams A. The coolest way to generate binary strings. Theory Comput Syst. 2014;54(4):551\u201377.","journal-title":"Theory Comput Syst."},{"key":"683_CR41","unstructured":"Storer T. Cyclotomy and difference sets., Lectures in advanced mathematics. Chicago: Markham Pub. Co.; 1967."},{"issue":"8","key":"683_CR42","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/TC.2017.2676763","volume":"66","author":"B Yang","year":"2017","unstructured":"Yang B, Mandal K, Aagaard MD, Gong G. Efficient composited de Bruijn sequence generators. IEEE Trans Comput. 2017;66(8):1354\u201368.","journal-title":"IEEE Trans Comput."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00683-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-021-00683-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00683-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T20:38:01Z","timestamp":1624739881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-021-00683-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,2]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["683"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00683-9","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,2]]},"assertion":[{"value":"8 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statements"}}],"article-number":"314"}}