{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:23Z","timestamp":1740122603285,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10623-022-01108-1","type":"journal-article","created":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T07:04:07Z","timestamp":1662534247000},"page":"285-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A relation between sequences generated by Golomb\u2019s preference algorithm"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1347-2560","authenticated-orcid":false,"given":"Yupeng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"issue":"12","key":"1108_CR1","first-page":"1204","volume":"19","author":"L Abraham","year":"1970","unstructured":"Abraham L.: On a homomorphism of the de bruijn graph and its applications to the design of feedback shift registers. IEEE Trans. Comput. C 19(12), 1204\u20131209 (1970).","journal-title":"IEEE Trans. Comput. C"},{"key":"1108_CR2","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."},{"issue":"7","key":"1108_CR3","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. Discret. Appl. Math. 160(7), 992\u2013998 (2012).","journal-title":"Discret. Appl. Math."},{"key":"1108_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10623-016-0314-4","volume":"85","author":"A Alhakim","year":"2017","unstructured":"Alhakim A., Nouiehed M.: Stretching de bruijn sequences. Des. Codes Crypt. 85, 381\u2013394 (2017).","journal-title":"Des. Codes Crypt."},{"key":"1108_CR5","doi-asserted-by":"crossref","unstructured":"Chang, Z., Ezerman, M.F., Fahreza, A.A., Wang, Q.: A graph joining greedy approach to binary de bruijn sequences. (2020). arXiv:2004.09810","DOI":"10.1007\/s00200-020-00459-3"},{"key":"1108_CR6","doi-asserted-by":"publisher","unstructured":"Chang, Z., Ezerman, M.F., Fahreza, A.A.: On greedy algorithms for binary de bruijn sequences. AAECC, 1\u201328 (2020). https:\/\/doi.org\/10.1007\/s00200-020-00459-3","DOI":"10.1007\/s00200-020-00459-3"},{"issue":"2","key":"1108_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."},{"issue":"4","key":"1108_CR8","first-page":"681","volume":"117","author":"DH Green","year":"1970","unstructured":"Green D.H., Dimond K.R.: Nonlinear product-feedback shift registers. Proc. IEE 117(4), 681\u2013686 (1970).","journal-title":"Proc. IEE"},{"key":"1108_CR9","series-title":"Lecture Notes in Computer Science","first-page":"104","volume-title":"Selected Areas in Cryptography, SAC 2012","author":"K Mandal","year":"2012","unstructured":"Mandal K., Gong G.: Cryptographically strong de bruijn sequences with large periods. In: Knudsen L.R., Wu H. (eds.) Selected Areas in Cryptography, SAC 2012, vol. 7707, pp. 104\u2013118. Lecture Notes in Computer Science. Springer, New York (2012)."},{"issue":"12","key":"1108_CR10","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":"2","key":"1108_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/S0019-9958(79)90708-3","volume":"43","author":"J Mykkeltveit","year":"1979","unstructured":"Mykkeltveit J., Siu M.-K., Tong P.: On the cycle structure of some nonlinear shift register sequences. Inf. Control 43(2), 202\u2013215 (1979).","journal-title":"Inf. Control"},{"key":"1108_CR12","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s10623-016-0322-4","volume":"85","author":"A Rubin","year":"2017","unstructured":"Rubin A., Weiss G.: Mapping prefer-opposite to prefer-one de bruijn sequences. Des. Codes Crypt. 85, 547\u2013555 (2017).","journal-title":"Des. Codes Crypt."},{"key":"1108_CR13","series-title":"Shift Register Sequences","volume-title":"Golomb","author":"W Solomon","year":"1967","unstructured":"Solomon W.: Golomb. Shift Register Sequences. Holden-Day, San Francisco, California (1967)."},{"key":"1108_CR14","unstructured":"Wang, X.F., Wong, D., Zhang, W.G.: A simple greedy de bruijn sequence construction. In: Sequences and Their Applications (SETA). (2018)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01108-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01108-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01108-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T10:15:14Z","timestamp":1673086514000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01108-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1108"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01108-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,9,7]]},"assertion":[{"value":"28 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}