{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T20:48:59Z","timestamp":1772052539651,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s00200-020-00459-3","type":"journal-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T20:02:25Z","timestamp":1602792145000},"page":"523-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On greedy algorithms for binary de Bruijn sequences"],"prefix":"10.1007","volume":"33","author":[{"given":"Zuling","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martianus Frederic","family":"Ezerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adamas Aqsa","family":"Fahreza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"key":"459_CR1","first-page":"758","volume":"49","author":"NG de Bruijn","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":"459_CR2","doi-asserted-by":"publisher","DOI":"10.1142\/9361","volume-title":"Shift Register Sequences","author":"SW Golomb","year":"2017","unstructured":"Golomb, S.W.: Shift Register Sequences, 3rd edn. World Scientific, Singapore (2017)","edition":"3"},{"issue":"3","key":"459_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de bruijn sequences. Discrete Math. 23(3), 207\u2013210 (1978)","journal-title":"Discrete Math."},{"issue":"2","key":"459_CR4","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."},{"issue":"3","key":"459_CR5","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":"1","key":"459_CR6","doi-asserted-by":"publisher","first-page":"P1.24","DOI":"10.37236\/5517","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. Electr. J. Comb. 23(1), P1.24 (2016)","journal-title":"Electr. J. Comb."},{"issue":"1","key":"459_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.disc.2015.08.002","volume":"339","author":"J Sawada","year":"2016","unstructured":"Sawada, J., Williams, A., Wong, D.: A surprisingly simple de Bruijn sequence construction. Discrete Math. 339(1), 127\u2013131 (2016)","journal-title":"Discrete Math."},{"issue":"3","key":"459_CR8","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.disc.2016.09.008","volume":"340","author":"J Sawada","year":"2017","unstructured":"Sawada, J., Williams, A., Wong, D.: A simple shift rule for k-ary de Bruijn sequences. Discrete Math. 340(3), 524\u2013531 (2017)","journal-title":"Discrete Math."},{"key":"459_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2018.03.006","volume":"72","author":"PB Dragon","year":"2018","unstructured":"Dragon, P.B., Hernandez, O.I., Sawada, J., Williams, A., Wong, D.: Constructing de Bruijn sequences with co-lexicographic order: the $$k$$-ary grandmama sequence. Eur. J. Comb. 72, 1\u201311 (2018)","journal-title":"Eur. J. Comb."},{"issue":"2","key":"459_CR10","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 19(2), 192\u2013199 (1975)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"459_CR11","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. Inform. Theory 30(3), 480\u2013484 (1984)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"459_CR12","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 11(1), 44\u201351 (1990)","journal-title":"J. Algorithms"},{"issue":"1","key":"459_CR13","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":"5","key":"459_CR14","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, M.F., Ling, S., Wang, H.: On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials. Des. Codes Cryptogr. 87(5), 1137\u20131160 (2019)","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"459_CR15","doi-asserted-by":"publisher","first-page":"728","DOI":"10.4169\/000298910x515794","volume":"117","author":"AM Alhakim","year":"2010","unstructured":"Alhakim, A.M.: A simple combinatorial algorithm for de Bruijn sequences. Am. Math. Mon. 117(8), 728\u2013732 (2010)","journal-title":"Am. Math. Mon."},{"issue":"7","key":"459_CR16","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.dam.2011.11.024","volume":"160","author":"A Alhakim","year":"2012","unstructured":"Alhakim, A.: Spans of preference functions for de Bruijn sequences. Discrete Appl. Math. 160(7), 992\u2013998 (2012)","journal-title":"Discrete Appl. Math."},{"key":"459_CR17","unstructured":"Wang, X., Wong, D., Zhang, W.G.: A simple greedy de Bruijn sequence construction. In: Presented at Sequences and Their Applications (SETA), Hong Kong, Oct. 1\u20136 (2018)"},{"key":"459_CR18","series-title":"Cambridge Mathematical Library","volume-title":"Graph Theory","author":"W Tutte","year":"2001","unstructured":"Tutte, W.: Graph Theory. Cambridge Mathematical Library. Cambridge University Press, Cambridge (2001)"},{"issue":"12","key":"459_CR19","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1090\/S0002-9904-1934-05988-3","volume":"40","author":"MH Martin","year":"1934","unstructured":"Martin, M.H.: A problem in arrangements. Bull. Am. Math. Soc. 40(12), 859\u2013865 (1934)","journal-title":"Bull. Am. Math. Soc."},{"key":"459_CR20","unstructured":"Knuth, D.E.: The Art of Computer Programming. Vol. 4A, Combinatorial Algorithms. Part 1, Addison-Wesley, Upple Saddle River (2011)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00459-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00459-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00459-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T14:05:13Z","timestamp":1665410713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00459-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,15]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["459"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00459-3","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,15]]},"assertion":[{"value":"3 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}