{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:51:37Z","timestamp":1773377497663,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849237","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2369-2373","source":"Crossref","is-referenced-by-count":7,"title":["Constrained de Bruijn Codes and their Applications"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[{"name":"Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion — Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van","family":"Khu Vu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion — Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion — Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222859"},{"key":"ref11","first-page":"845","article-title":"Binary codes capable of correcting insertions, deletions and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref12","author":"marcus","year":"2001","journal-title":"An introduction to coding for constrained systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.532887"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1126\/science.1145799"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488799"},{"key":"ref16","article-title":"Correcting two deletions and insertions in racetrack memory","author":"vahid","year":"2017"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100209"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2522434"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750388"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437483"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807480"},{"key":"ref6","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de bruijn","year":"1946","journal-title":"Koninklijke Nederlandse Akademie v Wetenschappen"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056919"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/080730093"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2164891"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1024041"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849237.pdf?arnumber=8849237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:05Z","timestamp":1773347645000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849237\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849237","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}