{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:25Z","timestamp":1773377005900,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFA1004900"],"award-info":[{"award-number":["2022YFA1004900"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12231014"],"award-info":[{"award-number":["12231014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195608","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Constrained Coding for Composite DNA: Channel Capacity and Efficient Constructions"],"prefix":"10.1109","author":[{"given":"Tuan Thanh","family":"Nguyen","sequence":"first","affiliation":[{"name":"Singapore University of Technology and Design,Science, Mathematics and Technology Cluster,Singapore,487372"}]},{"given":"Chen","family":"Wang","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Science, Mathematics and Technology Cluster,Singapore,487372"}]},{"given":"Kui","family":"Cai","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Science, Mathematics and Technology Cluster,Singapore,487372"}]},{"given":"Yiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Shandong University,Qingdao,Shandong,China,266237"}]},{"given":"Zohar","family":"Yakhini","sequence":"additional","affiliation":[{"name":"School of Computer Science,Herzliya Interdisciplinary Center,Herzliya,Israel"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3367748"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206892"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206609"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619131"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3401583"},{"key":"ref12","article-title":"High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes","author":"Ding","year":"2024","journal-title":"preprint, arXiv, arXiv"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3351991"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3066430"},{"key":"ref15","first-page":"1","article-title":"DNA codes with run-length limitation and Knuth-like balancing of the GC contents","volume-title":"Proc. Symp. Inf. Theory Appl. (SITA)","author":"Dube"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tmbmc.2024.3408053"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/isit57864.2024.10619348"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-58386-z"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619202"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/isit50566.2022.9834494"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.2981069"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref24","volume-title":"Codes for Mass Data Storage Systems","author":"Immink","year":"2004"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100209"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619700"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3119568"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.2610"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057136"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/isit44484.2020.9174430"},{"key":"ref32","article-title":"Constrained Coding for Composite DNA: Channel Capacity and Efficient Constructions","author":"Nguyen","journal-title":"preprint, arXiv"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195608.pdf?arnumber=11195608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:57Z","timestamp":1773347397000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195608\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195608","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}