---
res:
  bibo_abstract:
  - 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 Rn
    such that any point in Rn 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 exactly pin down the asymptotic
    density of (expurgated) Poisson Point Processes under a stronger notion called
    average-radius multiple packing. To this end, we apply tools from high-dimensional
    geometry and large deviation theory. This gives rise to the best known lower bound
    on the largest multiple packing density. Our result corrects a mistake in a previous
    paper by Blinovsky [Bli05].@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Yihan
      foaf_name: Zhang, Yihan
      foaf_surname: Zhang
      foaf_workInfoHomepage: http://www.librecat.org/personId=2ce5da42-b2ea-11eb-bba5-9f264e9d002c
    orcid: 0000-0002-6465-6258
  - foaf_Person:
      foaf_givenName: Shashank
      foaf_name: Vatedka, Shashank
      foaf_surname: Vatedka
  bibo_doi: 10.1109/ISIT50566.2022.9834512
  bibo_volume: 2022
  dct_date: 2022^xs_gYear
  dct_identifier:
  - UT:001254261902120
  dct_isPartOf:
  - http://id.crossref.org/issn/2157-8095
  - http://id.crossref.org/issn/9781665421591
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: List-decodability of Poisson Point Processes@
...
