{"month":"11","article_processing_charge":"No","external_id":{"arxiv":["2211.04408"]},"date_updated":"2023-12-18T07:46:45Z","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"type":"journal_article","day":"16","publication":"IEEE Transactions on Information Theory","author":[{"orcid":"0000-0002-6465-6258","full_name":"Zhang, Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","last_name":"Zhang","first_name":"Yihan"},{"full_name":"Vatedka, Shashank","last_name":"Vatedka","first_name":"Shashank"}],"doi":"10.1109/TIT.2023.3334032","_id":"14665","department":[{"_id":"MaMo"}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.04408","open_access":"1"}],"abstract":[{"text":"We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. For any N > 0 and L ∈ Z ≥2 , a multiple packing is a set C of points in R n such that any point in R n lies in the intersection of at most L - 1 balls of radius √ nN around points in C . This is a natural generalization of the sphere packing problem. We study the multiple packing problem for both bounded point sets whose points have norm at most √ nP for some constant P > 0, and unbounded point sets whose points are allowed to be anywhere in R n . Given a well-known connection with coding theory, multiple packings can be viewed as the Euclidean analog of list-decodable codes, which are well-studied over finite fields. We derive the best known lower bounds on the optimal multiple packing density. This is accomplished by establishing an inequality which relates the list-decoding error exponent for additive white Gaussian noise channels, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We also derive novel bounds on the list-decoding error exponent for infinite constellations and closed-form expressions for the list-decoding error exponents for the power-constrained AWGN channel, which may be of independent interest beyond multiple packing.","lang":"eng"}],"publication_status":"epub_ahead","article_type":"original","citation":{"ieee":"Y. Zhang and S. Vatedka, “Multiple packing: Lower bounds via error exponents,” <i>IEEE Transactions on Information Theory</i>. IEEE, 2023.","mla":"Zhang, Yihan, and Shashank Vatedka. “Multiple Packing: Lower Bounds via Error Exponents.” <i>IEEE Transactions on Information Theory</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/TIT.2023.3334032\">10.1109/TIT.2023.3334032</a>.","short":"Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory (2023).","apa":"Zhang, Y., &#38; Vatedka, S. (2023). Multiple packing: Lower bounds via error exponents. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.2023.3334032\">https://doi.org/10.1109/TIT.2023.3334032</a>","ista":"Zhang Y, Vatedka S. 2023. Multiple packing: Lower bounds via error exponents. IEEE Transactions on Information Theory.","chicago":"Zhang, Yihan, and Shashank Vatedka. “Multiple Packing: Lower Bounds via Error Exponents.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/TIT.2023.3334032\">https://doi.org/10.1109/TIT.2023.3334032</a>.","ama":"Zhang Y, Vatedka S. Multiple packing: Lower bounds via error exponents. <i>IEEE Transactions on Information Theory</i>. 2023. doi:<a href=\"https://doi.org/10.1109/TIT.2023.3334032\">10.1109/TIT.2023.3334032</a>"},"date_published":"2023-11-16T00:00:00Z","year":"2023","publisher":"IEEE","scopus_import":"1","oa_version":"Preprint","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-12-10T23:01:00Z","quality_controlled":"1","title":"Multiple packing: Lower bounds via error exponents","status":"public"}