{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T05:09:38Z","timestamp":1772860178063,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-2021-02533"],"award-info":[{"award-number":["RGPIN-2021-02533"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-2022-04149"],"award-info":[{"award-number":["RGPIN-2022-04149"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10623-023-01351-0","type":"journal-article","created":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T11:04:31Z","timestamp":1707217471000},"page":"1439-1454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using alternating de Bruijn sequences to construct de Bruijn tori"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5278-2425","authenticated-orcid":false,"given":"Matthew","family":"Kreitzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4172-2195","authenticated-orcid":false,"given":"Mihai","family":"Nica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3041-4672","authenticated-orcid":false,"given":"Rajesh","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,6]]},"reference":[{"issue":"7","key":"1351_CR1","doi-asserted-by":"publisher","first-page":"4884","DOI":"10.1109\/TIT.2012.2191699","volume":"58","author":"Alfred M Bruckstein","year":"2012","unstructured":"Bruckstein Alfred M., et al.: Simple and robust binary self-location patterns. IEEE Trans. Info. Theory 58(7), 4884\u20134889 (2012). https:\/\/doi.org\/10.1109\/TIT.2012.2191699.","journal-title":"IEEE Trans. Info. Theory"},{"key":"1351_CR2","volume-title":"Coding schemes for two-dimensional position sensing","author":"J Burns","year":"1992","unstructured":"Burns J., Mitchell C.J.: Coding schemes for two-dimensional position sensing. Technical Publications Department, Hewlett-Packard Laboratories (1992)."},{"key":"1351_CR3","doi-asserted-by":"publisher","DOI":"10.1201\/b14892","volume-title":"Graphs & digraphs","author":"G Chartrand","year":"2010","unstructured":"Chartrand G., Lesniak L., Zhang P.: Graphs & digraphs, vol. 39. CRC Press, Boca Raton (2010)."},{"key":"1351_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(88)90095-7","volume":"70","author":"JC Cock","year":"1988","unstructured":"Cock J.C.: Toroidal tilings from de Bruijn-Good cyclic sequences. Discret. Math. 70, 209\u2013210 (1988).","journal-title":"Discret. Math."},{"issue":"1","key":"1351_CR5","first-page":"758","volume":"49","author":"NG de Bruijn","year":"1946","unstructured":"de Bruijn N.G.: A combinatorial problem. Indagationes Math 49(1), 758\u2013764 (1946).","journal-title":"Indagationes Math"},{"issue":"5","key":"1351_CR6","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1109\/18.21260","volume":"34","author":"T Etzion","year":"1988","unstructured":"Etzion T.: Constructions for perfect maps and pseudorandom arrays. IEEE Trans. Inf. Theory 34(5), 1308\u20131316 (1988).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1351_CR7","first-page":"205","volume":"19A","author":"CT Fan","year":"1985","unstructured":"Fan C.T., et al.: On de Bruijn arrays. Ars Combinatoria 19A, 205\u2013213 (1985).","journal-title":"Ars Combinatoria"},{"key":"1351_CR8","first-page":"107","volume":"1","author":"C Flye Sainte-Marie","year":"1894","unstructured":"Flye Sainte-Marie C.: Solution to problem number. L\u2019Intermediare des Mathematiciens 1, 107\u2013110 (1894).","journal-title":"L\u2019Intermediare des Mathematiciens"},{"key":"1351_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.dam.2016.05.013","volume":"213","author":"T Grubman","year":"2016","unstructured":"Grubman T., Ahmet \u015eekercio\u011flu Y., Wood D.R.: Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking. Discret. Appl. Math. 213, 101\u2013113 (2016). https:\/\/doi.org\/10.1016\/j.dam.2016.05.013.","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"1351_CR10","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1016\/j.disc.2015.11.015","volume":"339","author":"V Horan","year":"2016","unstructured":"Horan V., Stevens B.: Locating patterns in the de Bruijn torus. Discret. Math. 339(4), 1274\u20131282 (2016).","journal-title":"Discret. Math."},{"key":"1351_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01390770","volume":"6","author":"GH Hurlbert","year":"1995","unstructured":"Hurlbert G.H., Isaak G.: New constructions for De Bruijn tori. Des. Codes Cryptogr. 6, 47\u201356 (1995).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1351_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0097-3165(96)80008-2","volume":"73","author":"KG Paterson","year":"1996","unstructured":"Paterson K.G.: New classes of perfect maps I. J. Comb. Theory Ser. A 73(2), 302\u2013334 (1996).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"1351_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0097-3165(96)80009-4","volume":"73","author":"KG Paterson","year":"1996","unstructured":"Paterson K.G.: New classes of perfect maps II. J. Comb. Theory Ser. A 73(2), 335\u2013345 (1996).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1351_CR14","doi-asserted-by":"crossref","unstructured":"Pudwell L., Rockey R.: de Bruijn Arrays for L-Fillings. In: Mathematics Magazine 87(1), pp. 57\u201360 (2014). http:\/\/www.jstor.org\/stable\/10.4169\/math.mag.87.1.57 (visited on 10\/27\/2022).","DOI":"10.4169\/math.mag.87.1.57"},{"issue":"1\u20133","key":"1351_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0012-365X(99)00304-0","volume":"218","author":"Y Shibata","year":"2000","unstructured":"Shibata Y., Hasunuma T., Fukuda S.: Isomorphic factorization of de Bruijn digraphs. Discret. Math. 218(1\u20133), 199\u2013208 (2000).","journal-title":"Discret. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01351-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01351-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01351-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T16:22:15Z","timestamp":1714666935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01351-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,6]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1351"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01351-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,6]]},"assertion":[{"value":"10 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 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 declare that there are no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}