{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:30Z","timestamp":1773378090807,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834443","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3085-3090","source":"Crossref","is-referenced-by-count":0,"title":["Lower bounds for Multiple Packing"],"prefix":"10.1109","author":[{"given":"Yihan","family":"Zhang","sequence":"first","affiliation":[{"name":"Institute of Science and Technology,Austria"}]},{"given":"Shashank","family":"Vatedka","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Department of Electrical Engineering,Hyderabad"}]}],"member":"263","reference":[{"key":"ref10","first-page":"34","volume":"44","author":"blinovsky","year":"2008"},{"key":"ref11","volume":"290","author":"conway","year":"2013","journal-title":"Sphere Packings Lattices and Groups"},{"key":"ref12","first-page":"vi+","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"delsarte","year":"1973","journal-title":"Philips Res Rep Suppl"},{"key":"ref13","author":"elias","year":"1957","journal-title":"List decoding for noisy channels"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref15","first-page":"3","article-title":"On bounds for packings on a sphere and in space","volume":"14","author":"kabatiansky","year":"1978","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057584"},{"key":"ref18","article-title":"Robust and adaptive communication under uncertain interference","author":"sarwate","year":"2008","journal-title":"PhD thesis"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/imrn\/rns096"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911215"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300003405"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057672"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-011-9336-x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.761296"},{"key":"ref7","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":"Problems of Information Transmission"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849801"},{"key":"ref1","first-page":"32","article-title":"New upper bounds for error-correcting codes","volume":"1","author":"bassalygo","year":"1965","journal-title":"Probl Inf Transm"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11122-005-0007-5"},{"key":"ref20","first-page":"90","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"Quarterly Progress Report"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174421"},{"key":"ref21","article-title":"Bounds for multiple packing and list-decoding error exponents","author":"zhang","year":"2021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437457"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834443.pdf?arnumber=9834443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:14Z","timestamp":1773347774000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834443\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834443","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}