{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:44Z","timestamp":1773377684806,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834795","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"264-269","source":"Crossref","is-referenced-by-count":3,"title":["Run Length Limited de Bruijn Sequences for Quantum Communications"],"prefix":"10.1109","author":[{"given":"Yeow","family":"Meng Chee","sequence":"first","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duc","family":"Tu Dao","sequence":"additional","affiliation":[{"name":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien","family":"Long Nguyen","sequence":"additional","affiliation":[{"name":"Hanoi University of Sciences and Technology,Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duy","family":"Hoang Ta","sequence":"additional","affiliation":[{"name":"École Normale Supérieure de Lyon,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van","family":"Khu Vu","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112300"},{"key":"ref11","article-title":"Robust data storage in DNA by de Bruijn graph-based decoding","author":"song","year":"0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1049\/qtc2.12019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1364\/OPTICA.5.001542"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/02286203.2020.1738035"},{"key":"ref15","author":"immink","year":"2004","journal-title":"Codes for Mass Data Storage Systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90591-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2145490"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517873"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30559-0_14"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90002-X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056919"},{"key":"ref27","first-page":"2027","article-title":"Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence","volume":"30","author":"kociumaka","year":"2016","journal-title":"Discrete Mathematics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch136"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222859"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1024041"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/356789.356792"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055666"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-21.3.167"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1515\/cait-2016-0019"},{"key":"ref1","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de bruijn","year":"1946","journal-title":"Koninklijke Nederlandse Akademie v Wetenschappen"},{"key":"ref20","first-page":"605","article-title":"De Bruijn sequences for fixed-weight binary strings","volume":"26","author":"ruskey","year":"2012","journal-title":"Discrete Mathematics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/5.63306"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.37236\/5517"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2014.06.003"},{"key":"ref23","first-page":"153","article-title":"Universal cycles of restricted words","volume":"106","author":"gardner","year":"2018","journal-title":"J Combin Math Combin Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00117-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.532887"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834795.pdf?arnumber=9834795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:52Z","timestamp":1773347692000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834795\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834795","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}