{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:54:17Z","timestamp":1730274857489,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875276","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"2459-2463","source":"Crossref","is-referenced-by-count":3,"title":["List decoding - Random coding exponents and expurgated exponents"],"prefix":"10.1109","author":[{"given":"Neri","family":"Merhav","sequence":"first","affiliation":[]}],"member":"263","reference":[{"journal-title":"Principles of Digital Communication and Coding","year":"1979","author":"viterbi","key":"19"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/18.641560"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.1998.706432"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5014-9_10"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1989.64204"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.1994.577040"},{"key":"11","article-title":"List decoding - random coding exponents and expurgated exponents","author":"merhav","year":"2013","journal-title":"IEEE Trans Inform Theory"},{"key":"12","article-title":"Expurgated random-coding ensembles: Exponents, refinements and connections","author":"scarlett","year":"2013","journal-title":"IEEE Trans Inform Theory"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csiszar","key":"3"},{"key":"20","article-title":"List decoding","author":"wozencraft","year":"1958","journal-title":"MIT Res Lab Electron"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013886231613"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.243443"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054129"},{"key":"6","first-page":"94","article-title":"List decoding for noisy channels","volume":"2","author":"elias","year":"1957","journal-title":"Proc IRE WESCON Conf Rec"},{"key":"5","first-page":"3","article-title":"Bounds on the average error probability for a code ensemble with fixed composition","volume":"16","author":"d'yachkov","year":"1980","journal-title":"Problems of Information Transmission"},{"key":"4","first-page":"107","article-title":"A new look at the error exponent of a discrete memoryless channel","author":"csiszar","year":"1977","journal-title":"Proc ISIT '77"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054971"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"8"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875276.pdf?arnumber=6875276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:25:23Z","timestamp":1602689123000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875276","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}