{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:12:18Z","timestamp":1771611138914,"version":"3.50.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1816965"],"award-info":[{"award-number":["CCF-1816965"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1717884"],"award-info":[{"award-number":["CCF-1717884"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postdoctoral Fellowship of the Center for the Mathematics of Information (CMI), Caltech"},{"name":"Lester-Deutsch Postdoctoral Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1109\/tit.2021.3063709","type":"journal-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T21:03:46Z","timestamp":1614891826000},"page":"2793-2807","source":"Crossref","is-referenced-by-count":29,"title":["On Coding Over Sliced Information"],"prefix":"10.1109","volume":"67","author":[{"given":"Jin","family":"Sima","sequence":"first","affiliation":[]},{"given":"Netanel","family":"Raviv","sequence":"additional","affiliation":[]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","volume":"4","author":"knuth","year":"2005","journal-title":"The art of computer programming"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2789292"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9893-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2762676"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961265"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849523"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref17","article-title":"Scaling up DNA data storage and random access retrieval","volume":"1","author":"organick","year":"2017","journal-title":"BioRxiv"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2829876"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"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":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2700847"},{"key":"ref5","first-page":"26","article-title":"There’s plenty of room at the bottom: An invitation to enter a new field of physics","author":"feynman","year":"2012","journal-title":"Handbook of Nanoscience Engineering and Technology"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref7","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":"ref2","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1126\/science.1226355","article-title":"Next-generation digital information storage in DNA","author":"church","year":"2012","journal-title":"Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282568"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2747557"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849737"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849789"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849687"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849596"},{"key":"ref26","article-title":"A rewritable, random-access DNA-based storage system","volume":"5","author":"yazdi","year":"2015","journal-title":"Sci Rep"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797619"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9409872\/09369384.pdf?arnumber=9369384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:14Z","timestamp":1652194454000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9369384\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":26,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3063709","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}