---
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 P, N > 0 and L∈Z≥2. A multiple packing is a set C of points in
    Bn(0–,nP−−−√) such that any point in ℝ n lies in the intersection of at most L
    – 1 balls of radius nN−−−√ around points in C. 1 In this paper, we derive two
    lower bounds on the largest possible density of a multiple packing. These bounds
    are obtained through a stronger notion called average-radius multiple packing.
    Specifically, we exactly pin down the asymptotics of (expurgated) Gaussian codes
    and (expurgated) spherical codes under average-radius multiple packing. To this
    end, we apply tools from high-dimensional geometry and large deviation theory.
    The bound for spherical codes matches the previous best known bound which was
    obtained for the standard (weaker) notion of multiple packing through a curious
    connection with error exponents [Bli99], [ZV21]. The bound for Gaussian codes
    suggests that they are strictly inferior to spherical codes.@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.9834443
  bibo_volume: 2022
  dct_date: 2022^xs_gYear
  dct_identifier:
  - UT:001254261903042
  dct_isPartOf:
  - http://id.crossref.org/issn/2157-8095
  - http://id.crossref.org/issn/9781665421591
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: Lower bounds for multiple packing@
...