{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:54Z","timestamp":1773376734630,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619219","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1343-1348","source":"Crossref","is-referenced-by-count":2,"title":["On de Bruijn Covering Sequences and Arrays"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}]},{"given":"Hoang","family":"Ta","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}]},{"given":"Van Khu","family":"Vu","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}]}],"member":"263","reference":[{"key":"ref1","first-page":"203","article-title":"Circuits and trees in ordered linear graphs","volume":"28","author":"Van Aardenne-Ehrenfest","year":"1951","journal-title":"Simon Steven"},{"issue":"7","key":"ref2","first-page":"758","article-title":"A combinatorial problem","volume-title":"Proceedings of the Section of Sciences of the Koninklijke Nederlandse Akademie van Wetenschappen te Amsterdam","volume":"49","author":"De Bruijn","year":"1946"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-21.3.167"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191699"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834795"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/c2022-0-02564-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/9361"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/12.21149"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2005.05.007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813490"},{"key":"ref12","article-title":"Anchor points algorithms for hamming and edit distance","volume-title":"Proceedings of ICDT","author":"Afrati","year":"2014"},{"key":"ref13","volume-title":"Covering codes","author":"Cohen","year":"1997"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2985691"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366874"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20033"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2004.05.004"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.21260"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023754"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.335886"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1976.10411"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/34.667888"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<467::AID-RSA15>3.0.CO;2-W"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1991-1079013-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057033"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.42182"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0525-y"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056965"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.490544"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619219.pdf?arnumber=10619219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:00Z","timestamp":1773347280000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619219\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619219","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}