{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T05:49:52Z","timestamp":1744868992604},"reference-count":2,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365266","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:17Z","timestamp":1103794457000},"page":"229-229","source":"Crossref","is-referenced-by-count":19,"title":["Insertion\/deletion channels: reduced-state lower bounds on channel capacities"],"prefix":"10.1109","author":[{"given":"A.","family":"Kavcic","sequence":"first","affiliation":[]},{"given":"R.H.","family":"Motwani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref2","first-page":"119","article-title":"Simulation Based Computation of Information Rates: Upper and Lower Bounds by Reduced-State Techniques","author":"arnold","year":"2003","journal-title":"Proc ISIT"},{"key":"ref1","article-title":"On transmission over deletion channels","author":"diggavi","year":"2001","journal-title":"Allerton Conference"}],"event":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","location":"Chicago, Illinois, USA"},"container-title":["International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9423\/29909\/01365266.pdf?arnumber=1365266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T03:52:52Z","timestamp":1489463572000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":2,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365266","relation":{},"subject":[]}}