{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:50:58Z","timestamp":1730274658746,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283735","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T16:57:57Z","timestamp":1346345877000},"page":"2112-2116","source":"Crossref","is-referenced-by-count":14,"title":["The adversarial joint source-channel problem"],"prefix":"10.1109","author":[{"given":"Yuval","family":"Kochman","sequence":"first","affiliation":[]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[]},{"given":"Yury","family":"Polyanskiy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","first-page":"7","article-title":"Bounds for codes in the case of list decoding of finite volume","volume":"22","author":"blinovsky","year":"1986","journal-title":"Prob Peredachi Inform"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2070170"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810631"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"key":"3","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","author":"shannon","year":"1959","journal-title":"1959 IRE Nat Conv Rec"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120166"},{"journal-title":"Covering Codes","year":"1997","author":"cohen","key":"7"},{"journal-title":"Rate-Distortion Theory A Mathematical Basis for Data Compression","year":"1971","author":"berger","key":"6"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisza?r","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056823"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1997","author":"macwilliams","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06283735.pdf?arnumber=6283735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T18:04:34Z","timestamp":1490119474000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283735\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283735","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}