{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:51:53Z","timestamp":1730274713597,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620220","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"221-225","source":"Crossref","is-referenced-by-count":1,"title":["Refined bounds on the empirical distribution of good channel codes via concentration inequalities"],"prefix":"10.1109","author":[{"given":"Maxim","family":"Raginsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igal","family":"Sason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","first-page":"291","article-title":"An information theoretical identity and a problem involving capacity","volume":"2","author":"tops\ufffde","year":"1967","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"journal-title":"Topics in Optimal Transportation","year":"2003","author":"villani","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805064"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.568695"},{"journal-title":"Concentration of Measure Inequalities in Information Theory Communications and Coding","year":"2012","author":"raginsky","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531808"},{"key":"2","first-page":"216","article-title":"An elementary proof of the strong converse theorem for the multiple-access channel","volume":"7","author":"ahlswede","year":"1982","journal-title":"Journal of Combinatorics Information and System Sciences"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535683"},{"journal-title":"Empirical Distribution of Good Channel Codes with Non-vanishing Error Probability","year":"0","author":"polyanskiy","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2186786"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csiszar","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1006\/jfan.1998.3326"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107359949.008"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620220.pdf?arnumber=6620220","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T21:03:50Z","timestamp":1490216630000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620220\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620220","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}