{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:12:27Z","timestamp":1730207547121,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/ciss.2012.6310937","type":"proceedings-article","created":{"date-parts":[[2012,10,2]],"date-time":"2012-10-02T11:08:30Z","timestamp":1349176110000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["On asynchronous capacity and dispersion"],"prefix":"10.1109","author":[{"given":"Yury","family":"Polyanskiy","sequence":"first","affiliation":[]}],"member":"263","reference":[{"journal-title":"Channel Coding Non-Asymptotic Fundamental Limits","year":"2010","author":"polyanskiy","key":"17"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557341"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systemst","year":"1981","author":"csisza?r","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033695"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.32152"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513323"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693055"},{"journal-title":"Asynchronous Communication Capacity Bounds and Suboptimality of Training","year":"2011","author":"tchamkerten","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2027484"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033966"},{"key":"7","first-page":"30","article-title":"One method of constructing quasilinear codes providing synchronization in the presence of errors","volume":"7","author":"levenshtein","year":"1971","journal-title":"Prob Peredachi Inform"},{"key":"6","first-page":"11","article-title":"Shannon's theorems for channels with synchronization errors","volume":"3","author":"dobrushin","year":"1967","journal-title":"Prob Peredachi Inform"},{"key":"5","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.370109"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057012"},{"key":"8","first-page":"12","article-title":"Coding in an asynchronous multiple-access channel","volume":"19","author":"poltyrev","year":"1983","journal-title":"Prob Peredachi Inform"}],"event":{"name":"2012 46th Annual Conference on Information Sciences and Systems (CISS)","start":{"date-parts":[[2012,3,21]]},"location":"Princeton, NJ, USA","end":{"date-parts":[[2012,3,23]]}},"container-title":["2012 46th Annual Conference on Information Sciences and Systems (CISS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6299180\/6310704\/06310937.pdf?arnumber=6310937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T19:19:49Z","timestamp":1490123989000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6310937\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/ciss.2012.6310937","relation":{},"subject":[],"published":{"date-parts":[[2012,3]]}}}