{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:16:18Z","timestamp":1729620978968,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282852","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"2231-2235","source":"Crossref","is-referenced-by-count":1,"title":["Upper bound on list-decoding radius of binary codes"],"prefix":"10.1109","author":[{"given":"Yury","family":"Polyanskiy","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/11538462_27","article-title":"A lower bound on list size for list decoding","author":"guruswami","year":"2005","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.412711"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(98)00183-6"},{"key":"ref13","article-title":"Hypercontractivity of spherical averages in Hamming space","author":"polyanskiy","year":"2013","journal-title":"Arxiv preprint arXiv 1309 3014"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858977"},{"key":"ref15","article-title":"Upper bound on list-decoding radius of binary codes","author":"polyanskiy","year":"2014","journal-title":"arXiv preprint arXiv 1409 7765"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.748991"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282457"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283735"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6048-4_20"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref8","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":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3176"},{"key":"ref2","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"MA Tech Rep RLE Quart Progr"},{"key":"ref1","article-title":"List decoding for noisy channels","author":"elias","year":"1957","journal-title":"MA Tech Rep RLE-TR-335"},{"key":"ref9","first-page":"23","article-title":"Code bounds for multiple packings over a nonbinary finite alphabet","volume":"41","year":"2005","journal-title":"Prob Peredachi Inform"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282852.pdf?arnumber=7282852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T16:37:52Z","timestamp":1498235872000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282852\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282852","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}