{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:29Z","timestamp":1773377669323,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174438","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"694-699","source":"Crossref","is-referenced-by-count":21,"title":["Constrained Coding with Error Control for DNA-Based Data Storage"],"prefix":"10.1109","author":[{"given":"Tuan Thanh","family":"Nguyen","sequence":"first","affiliation":[{"name":"Singapore University of Technology and Design,Singapore,487372"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kui","family":"Cai","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Singapore,487372"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kees A.","family":"Schouhamer Immink","sequence":"additional","affiliation":[{"name":"Turing Machines Inc,DK Rotterdam,The Netherlands,3016"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Mao Kiah","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University,Singapore,637371"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778143"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2866566"},{"key":"ref12","article-title":"DNA Codes with Run-Length Limitation and Knuth-Like Balancing of the GC Contents","author":"dub\u00e9","year":"2019","journal-title":"Symp Information Theory and its Applications (SITA 92)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2930970"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2980036"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj454"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057136"},{"key":"ref17","article-title":"Capacity-Approaching Constrained Codes with Error Correction for DNA-Based Data Storage","author":"nguyen","year":"2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100209"},{"key":"ref19","article-title":"Repeated-Free Codes","author":"elishco","year":"2019","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1126\/science.aaj2038","article-title":"DNA fountain enables a robust and efficient storage architecture","volume":"355","author":"erlich","year":"2017","journal-title":"Science"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1038\/nature11875","article-title":"Towards practical, high-capacity, low-maintenance information storage in synthesized DNA","volume":"494","author":"goldman","year":"2013","journal-title":"Nature"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2013-14-5-r51"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2775608"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-019-45832-6","article-title":"A Characterization of the DNA Data Storage Channel","author":"heckel","year":"2019","journal-title":"Scientific Reports"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1126\/science.1226355","article-title":"Next-generation digital information storage in DNA","volume":"337","author":"church","year":"2012","journal-title":"Science"},{"key":"ref9","article-title":"Optimal Codes Correcting a Single Indel \/ Edit for DNA-Based Data Storage","author":"cai","year":"2019"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-017-05188-1","article-title":"Portable and error-free DNAbased data storage","volume":"7","author":"yazdi","year":"2017","journal-title":"Scientific Reports"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140511"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.2610"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref23","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref25","article-title":"Subblock Energy-Constrained Codes: Knuth’s Balancing and Sequence Replacement Techniques","author":"nguyen","year":"2020","journal-title":"to appear accepted in Proc IEEE Int Symp Inf Theory (ISIT)"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174438.pdf?arnumber=9174438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:49Z","timestamp":1773347689000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174438\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174438","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}