{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:12Z","timestamp":1740122532966,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T00:00:00Z","timestamp":1658620800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T00:00:00Z","timestamp":1658620800000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10623-022-01077-5","type":"journal-article","created":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T16:02:38Z","timestamp":1658678558000},"page":"2319-2335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Designing preference functions for de Bruijn sequences with forbidden words"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2995-3740","authenticated-orcid":false,"given":"Abbas","family":"Alhakim","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,24]]},"reference":[{"issue":"8","key":"1077_CR1","doi-asserted-by":"publisher","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).","journal-title":"Am. Math. Monthly"},{"issue":"7\u20138","key":"1077_CR2","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. Discret. Appl. Math. 160(7\u20138), 992\u2013998 (2012).","journal-title":"Discret. Appl. Math."},{"issue":"12","key":"1077_CR3","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1016\/j.disc.2015.05.025","volume":"338","author":"YH Au","year":"2015","unstructured":"Au Y.H.: Generalized de Bruijn words for primitive words and powers. Discret. Math. 338(12), 2320\u20132331 (2015).","journal-title":"Discret. Math."},{"issue":"18","key":"1077_CR4","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1016\/j.ipl.2011.06.013","volume":"111","author":"V Becher","year":"2011","unstructured":"Becher V., Heiber P.A.: On extending de Bruijn sequences. Inform. Process. Lett. 111(18), 930\u2013932 (2011).","journal-title":"Inform. Process. Lett."},{"key":"1077_CR5","doi-asserted-by":"crossref","unstructured":"Chang Z., Ezerman M.F., Fahreza A.A.: On greedy algorithms for binary de Bruijn sequences. Appl. Algebra Eng. Commun. Comput. (2020).","DOI":"10.1007\/s00200-020-00459-3"},{"issue":"1\u20133","key":"1077_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"F Chung","year":"1992","unstructured":"Chung F., Diaconis P., Graham R.: Universal cycles for combinatorial structures. Discret. Math. 110(1\u20133), 43\u201355 (1992).","journal-title":"Discret. Math."},{"key":"1077_CR7","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":"1077_CR8","first-page":"70","volume":"77","author":"C Eldert","year":"1958","unstructured":"Eldert C., Gray H.J., Gurk H.M., Rubinoff M.: Shifting counters. AIEE Trans. 77, 70\u201374 (1958).","journal-title":"AIEE Trans."},{"key":"1077_CR9","unstructured":"Ford L.R.: A Cyclic Arrangement of $$m$$-tuples, Report P-1071, Rand Corp., (1957)"},{"key":"1077_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, 195\u2013221 (1982).","journal-title":"SIAM Rev."},{"issue":"4","key":"1077_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2021.112780","volume":"345","author":"D Gabric","year":"2022","unstructured":"Gabric D., Sawada J.: Investigating the discrepancy property of de Bruijn sequences. Discret. Math. 345(4), 1\u201315 (2022).","journal-title":"Discret. Math."},{"key":"1077_CR12","volume-title":"Shift Register Sequences","author":"S Golomb","year":"1967","unstructured":"Golomb S.: Shift Register Sequences. Holden-Day, San Francisco (1967)."},{"key":"1077_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0012-365X(99)00230-7","volume":"1\u20133","author":"SG Hartke","year":"2000","unstructured":"Hartke S.G.: Binary De Bruijn cycles under different equivalence relations. Discret. Math. 1\u20133, 93\u2013102 (2000).","journal-title":"Discret. Math."},{"key":"1077_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(94)00314-9","volume":"149","author":"G Hurlbert","year":"1996","unstructured":"Hurlbert G., Isaak G.: Equivalence class universal cycles for permutations. Discret. Math. 149, 123\u2013129 (1996).","journal-title":"Discret. Math."},{"key":"1077_CR15","unstructured":"K\u00e1sa Z.: On arc-disjoint Hamiltonian cycles in de Bruijn graphs. CoRR abs\/1003.1520 (2010)"},{"key":"1077_CR16","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1968","unstructured":"Knuth D.E.: The Art of Computer Programming, vol. 1. Addison-Wesley, Reading (1968)."},{"key":"1077_CR17","unstructured":"Lin Y-L., Ward C., Jain B., Skiena S.: Constructing Orthogonal de\u00a0Bruijn Sequences, Proceedings of the 12th International Symposium on Algorithms and Data Structures, New York, August 15-17, (LNCS, V. 6844), (2011)."},{"key":"1077_CR18","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, 859\u2013864 (1934).","journal-title":"Bull. Am. Math. Soc."},{"key":"1077_CR19","doi-asserted-by":"crossref","unstructured":"Moreno E., Matamala M.: Minimal de Bruijn Sequence in a Language with Forbidden Substrings. In: J. Hromkovi\u010d, M. Nagl, B. Westfechtel (eds) Graph-Theoretic Concepts in Computer Science. WG . Lecture Notes in Computer Science, vol 3353. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30559-0_14"},{"issue":"6","key":"1077_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ipl.2005.05.028","volume":"96","author":"E Moreno","year":"2005","unstructured":"Moreno E.: De Bruijn sequences and de Bruijn graphs for a general language. Inform. Process. Lett. 96(6), 214\u2013219 (2005).","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"1077_CR21","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1016\/j.disc.2009.10.009","volume":"310","author":"R Penne","year":"2010","unstructured":"Penne R.: A note on certain de Bruijn sequences with forbidden subsequences. Discret. Math. 310(4), 966\u2013969 (2010).","journal-title":"Discret. Math."},{"issue":"3","key":"1077_CR22","first-page":"1","volume":"45","author":"F Ruskey","year":"2010","unstructured":"Ruskey F., Williams A.: An explicit universal cycle for the $$(n - 1)$$-permutations of an $$n$$-set. ACM Trans. Algor. 45(3), 1\u201312 (2010).","journal-title":"ACM Trans. Algor."},{"key":"1077_CR23","unstructured":"Sala E., Sawada J., Alhakim A.: Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences. Submitted (2020)."},{"key":"1077_CR24","doi-asserted-by":"crossref","unstructured":"Sawada J., Stevens B., Williams A.: De Bruijn Sequences for the Binary Strings with Maximum Density. In: Katoh N., Kumar A. (eds) WALCOM: Algorithms and Computation. WALCOM 2011. Lecture Notes in Computer Science, vol 6552. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-19094-0_19"},{"key":"1077_CR25","unstructured":"Wang X., Sun Y., Zhang W.: State Diagrams of a Class of Singular LFSR and Their Applications to the Construction of de Bruijn Cycles. arXiv:1805.00147 [math.CO]."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01077-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01077-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01077-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T17:16:02Z","timestamp":1663607762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01077-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,24]]},"references-count":25,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1077"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01077-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,7,24]]},"assertion":[{"value":"7 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}