{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:54:59Z","timestamp":1777964099187,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319663951","type":"print"},{"value":"9783319663968","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66396-8_6","type":"book-chapter","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T09:57:59Z","timestamp":1502704679000},"page":"49-58","source":"Crossref","is-referenced-by-count":1,"title":["A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gabric","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,15]]},"reference":[{"key":"6_CR1","unstructured":"The On-Line Encyclopedia of Integer Sequences (2010). https:\/\/oeis.org , sequence A000016"},{"issue":"8","key":"6_CR2","doi-asserted-by":"crossref","first-page":"728","DOI":"10.4169\/000298910x515794","volume":"117","author":"A Alhakim","year":"2010","unstructured":"Alhakim, A.: A simple combinatorial algorithm for de Bruijn sequences. Am. Math. Monthly 117(8), 728\u2013732 (2010). http:\/\/www.jstor.org\/stable\/10.4169\/000298910x515794","journal-title":"Am. Math. Monthly"},{"issue":"4\/5","key":"6_CR3","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"KS Booth","year":"1980","unstructured":"Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4\/5), 240\u2013242 (1980)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"6_CR4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.2000.1108","volume":"37","author":"K Cattell","year":"2000","unstructured":"Cattell, K., Ruskey, F., Sawada, J., Serra, M., Miers, C.: Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2). J. Algorithms 37(2), 267\u2013282 (2000)","journal-title":"J. Algorithms"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1016\/j.disc.2009.11.010","volume":"310","author":"J Cooper","year":"2010","unstructured":"Cooper, J., Heitsch, C.: The discrepancy of the lex-least de Bruijn sequence. Discrete Math. 310, 1152\u20131159 (2010)","journal-title":"Discrete Math."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-662-49529-2_26","volume-title":"LATIN 2016: Theoretical Informatics","author":"PB Dragon","year":"2016","unstructured":"Dragon, P.B., Hernandez, O.I., Williams, A.: The grandmama de Bruijn sequence for binary strings. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 347\u2013361. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49529-2_26"},{"key":"6_CR7","first-page":"70","volume":"77","author":"C Eldert","year":"1958","unstructured":"Eldert, C., Gray, H., Gurk, H., Rubinoff, M.: Shifting counters. AIEE Trans. 77, 70\u201374 (1958)","journal-title":"AIEE Trans."},{"issue":"5","key":"6_CR8","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TIT.1984.1056965","volume":"30","author":"T Etzion","year":"1984","unstructured":"Etzion, T., Lempel, A.: Construction of de Bruijn sequences of minimal complexity. IEEE Trans. Inf. Theory 30(5), 705\u2013709 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"6_CR9","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0097-3165(87)90035-5","volume":"44","author":"T Etzion","year":"1987","unstructured":"Etzion, T.: Self-dual sequences. J. Comb. Theory Ser. A 44(2), 288\u2013298 (1987). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0097316587900355","journal-title":"J. Comb. Theory Ser. A"},{"key":"6_CR10","unstructured":"Ford, L.: A cyclic arrangement of $${M}$$ M -tuples. Report No. P-1071, Rand Corporation, Santa Monica, 23 April 1957"},{"key":"6_CR11","doi-asserted-by":"crossref","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$$ k colors and $$k$$ k -ary de Bruijn sequences. Discrete Math. 23, 207\u2013210 (1978)","journal-title":"Discrete Math."},{"issue":"1","key":"6_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0097-3165(72)90091-X","volume":"12","author":"H Fredricksen","year":"1972","unstructured":"Fredricksen, H.: Generation of the Ford sequence of length $$2^n$$ 2 n , $$n$$ n large. J. Comb. Theory Ser. A 12(1), 153\u2013154 (1972). http:\/\/www.sciencedirect.com\/science\/article\/pii\/009731657290091X","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"6_CR13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(86)90089-0","volume":"61","author":"H Fredricksen","year":"1986","unstructured":"Fredricksen, H., Kessler, I.: An algorithm for generating necklaces of beads in two colors. Discrete Math. 61(2), 181\u2013188 (1986). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X86900890","journal-title":"Discrete Math."},{"key":"6_CR14","volume-title":"Shift Register Sequences","author":"SW Golomb","year":"1981","unstructured":"Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1981)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(94)00057-P","volume":"145","author":"ER Hauge","year":"1995","unstructured":"Hauge, E.R.: On the cycles and adjacencies in the complementary circulating register. Discrete Math. 145(1), 105\u2013132 (1995). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X9400057P","journal-title":"Discrete Math."},{"issue":"1","key":"6_CR16","doi-asserted-by":"crossref","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). http:\/\/www.sciencedirect.com\/science\/article\/pii\/019667749090028D","journal-title":"J. Algorithms"},{"issue":"12","key":"6_CR17","doi-asserted-by":"crossref","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\u2013864 (1934)","journal-title":"Bull. Am. Math. Soc."},{"issue":"4","key":"6_CR18","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/0196-8858(92)90021-N","volume":"13","author":"GL Mayhew","year":"1992","unstructured":"Mayhew, G.L., Golomb, S.W.: Characterizations of generators for modified de Bruijn sequences. Adv. Appl. Math. 13(4), 454\u2013461 (1992). http:\/\/www.sciencedirect.com\/science\/article\/pii\/019688589290021N","journal-title":"Adv. Appl. Math."},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C., Wang, T.M.Y.: Generating necklaces. J. Algorithms 13, 414\u2013430 (1992)","journal-title":"J. Algorithms"},{"key":"6_CR20","doi-asserted-by":"crossref","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, 127\u2013131 (2016)","journal-title":"Discrete Math."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A., Wong, D.: Necklaces and Lyndon words in colexicographic and reflected Gray code order (2017). Submitted manuscript","DOI":"10.1016\/j.jda.2017.10.002"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66396-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T07:28:18Z","timestamp":1570001298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66396-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319663951","9783319663968"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66396-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}