{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:34:04Z","timestamp":1729643644048,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034143","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"346-350","source":"Crossref","is-referenced-by-count":15,"title":["Achievable rates for channels with deletions and insertions"],"prefix":"10.1109","author":[{"given":"Ramji","family":"Venkataramanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sekhar","family":"Tatikonda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557469"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TIT.2009.2034883","article-title":"Directly lower bounding the information capacity for channels with i.i.d.deletions and duplications","volume":"56","author":"drinea","year":"2010","journal-title":"IEEE Trans Inf Theory"},{"key":"ref10","article-title":"Sequential decoding for binary channels with noise and synchronization errors","author":"gallager","year":"0","journal-title":"October 1961 Lincoln Lab Group Report"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046210"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.110310.090039"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/08-PS141","article-title":"A survey of results for deletion channels and related synchronization channels","volume":"6","author":"mitzenmacher","year":"2009","journal-title":"Probability Surveys"},{"key":"ref12","first-page":"18","article-title":"Shannon's theorems for channels with synchronization errors","volume":"3","author":"dobrushin","year":"1967","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513745"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513746"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901221"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911291"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864445"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034143.pdf?arnumber=6034143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T03:35:38Z","timestamp":1497929738000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034143\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034143","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}