{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:59Z","timestamp":1740122519178,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["1232013"],"award-info":[{"award-number":["1232013"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10623-024-01425-7","type":"journal-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T11:02:06Z","timestamp":1718017326000},"page":"3017-3032","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On prefer-one sequences"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1347-2560","authenticated-orcid":false,"given":"Yupeng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"key":"1425_CR1","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, 728\u2013732 (2010).","journal-title":"Am. Math. Mon."},{"key":"1425_CR2","volume-title":"Boolean Functions for Cryptography and Coding Theory","author":"C Claude","year":"2021","unstructured":"Claude C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)."},{"issue":"5","key":"1425_CR3","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00200-020-00459-3","volume":"33","author":"Z Chang","year":"2022","unstructured":"Chang Z., Ezerman M.F., Fahreza A.A.: On greedy algorithms for binary de Bruijn sequences. Appl. Algebra Eng. Commun. Comput. 33(5), 523\u2013550 (2022).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"1","key":"1425_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0021-9800(70)80050-3","volume":"9","author":"H Fredricksen","year":"1970","unstructured":"Fredricksen H.: The lexicographically least de Bruijn cycle. J. Comb. Theory 9(1), 1\u20135 (1970).","journal-title":"J. Comb. Theory"},{"issue":"1","key":"1425_CR5","doi-asserted-by":"publisher","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$$, $$n$$ large. J. Comb. Theory Ser. A 12(1), 153\u2013154 (1972).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"1425_CR6","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":"2","key":"1425_CR7","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":"1425_CR8","volume-title":"Shift Register Sequences","author":"SW Golomb","year":"1967","unstructured":"Golomb S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967)."},{"issue":"12","key":"1425_CR9","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\u2013864 (1934).","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"1425_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/0097-3165(71)90012-4","volume":"11","author":"S Mossige","year":"1971","unstructured":"Mossige S.: Constructive theorems for the truth table of the ford sequence. J. Comb. Theory Ser. A 11(1), 106\u2013110 (1971).","journal-title":"J. Comb. Theory Ser. A"},{"unstructured":"Wang X.F., Wong D., Zhang W.G.: A simple greedy de bruijn sequence construction. In: Sequences and Their Applications (SETA) (2018).","key":"1425_CR11"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01425-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01425-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01425-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T20:19:16Z","timestamp":1726690756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01425-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":11,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1425"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01425-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"13 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}]}}