Multiple packing: Lower bounds via infinite constellations Zhang, Yihan ; https://orcid.org/0000-0002-6465-6258 Vatedka, Shashank We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let 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 . 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 for finite fields. In this paper, we derive the best known lower bounds on the optimal density of list-decodable infinite constellations for constant L under a stronger notion called average-radius multiple packing. To this end, we apply tools from high-dimensional geometry and large deviation theory. IEEE 2023 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/12838 Zhang Y, Vatedka S. Multiple packing: Lower bounds via infinite constellations. <i>IEEE Transactions on Information Theory</i>. 2023;69(7):4513-4527. doi:<a href="https://doi.org/10.1109/TIT.2023.3260950">10.1109/TIT.2023.3260950</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1109/TIT.2023.3260950 info:eu-repo/semantics/altIdentifier/issn/0018-9448 info:eu-repo/semantics/altIdentifier/e-issn/1557-9654 info:eu-repo/semantics/altIdentifier/wos/001017307000023 info:eu-repo/semantics/altIdentifier/arxiv/2211.04407 info:eu-repo/semantics/openAccess