{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:04:29Z","timestamp":1730279069493,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613485","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T00:39:34Z","timestamp":1547771974000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Maximum Likelihood Upper Bounds on the Capacities of Discrete Information Stable Channels"],"prefix":"10.1109","author":[{"given":"Tongxin","family":"Li","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920243"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878110"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.04.080683"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.370119"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"2623","DOI":"10.1109\/18.796417","article-title":"optimistic shannon coding theorems for arbitrary single-user systems","volume":"45","author":"chen","year":"1999","journal-title":"IEEE Transactions on Information Theory"},{"journal-title":"A New Basic Theorem of Information Theory","year":"1954","author":"feinstein","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(57)90039-6"},{"key":"ref18","volume":"2","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"journal-title":"Probabilistic Information Theory Discrete and Memoryless Models","year":"1968","author":"jelinek","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.335960"},{"key":"ref3","first-page":"285","article-title":"On Shannon theorem and its converse for sequence of communication schemes in the case of abstract random variables","author":"hu","year":"1964","journal-title":"Trans 3rd Prague Conference on Information Theory Statistical Decision Functions Random Processes Czechslovak Academy of Sciences Prague"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813556"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008147"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref7","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":"ref2","first-page":"323","article-title":"General formulation of Shannon’s main theorem in information theory","volume":"33","author":"dobrushin","year":"1963","journal-title":"Amer Math Soc Trans"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613485"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref22","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":"ref21","article-title":"Capacity upper bounds for deletion-type channels","author":"cheraghchi","year":"2017","journal-title":"arXiv preprint arXiv 1711 03890"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2368553"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046210"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2413958"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283980"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2018,11,25]]},"location":"Guangzhou","end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8598908\/8613300\/08613485.pdf?arnumber=8613485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T22:41:48Z","timestamp":1643236908000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613485\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613485","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}