{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:49Z","timestamp":1773377929358,"version":"3.50.1"},"reference-count":17,"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.8849483","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"932-936","source":"Crossref","is-referenced-by-count":12,"title":["Repeat-Free Codes"],"prefix":"10.1109","author":[{"given":"Ohad","family":"Elishco","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, MA, 02139"}]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[{"name":"Spawar Systems Center, San Diego, CA, 92115"}]},{"given":"Muriel","family":"M\u00e9dard","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, MA, 02139"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion – Israel Institute of Technology, Haifa, 3200009, Israel"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Eulerian paths with regular constraints","volume":"58","author":"kupferman","year":"2016","journal-title":"Leibniz International Proceedings in Informatics (LIPIcs)"},{"key":"ref11","article-title":"Bounds on codes correcting tandem and palindromic duplications","author":"lenz","year":"2017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref13","article-title":"Mutually uncorrelated codes for dna storage","author":"levy","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","article-title":"Evolution of k-mer frequencies and entropy in duplication and substitution mutation systems","author":"lou","year":"2018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00153-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90143-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-3165(03)00103-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2747557"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1024041"},{"key":"ref5","article-title":"The capacity of some pólya string models","volume":"abs 1808 6062","author":"elishco","year":"2018","journal-title":"CoRR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437909"},{"key":"ref2","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"bruijn","year":"1946","journal-title":"Koninklijke Nederlandse Akademie v Wetenschappen"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513668"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555321"}],"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\/08849483.pdf?arnumber=8849483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:35Z","timestamp":1773347735000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849483\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849483","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}