---
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
    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.@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/TIT.2023.3260950
  bibo_issue: '7'
  bibo_volume: 69
  dct_date: 2023^xs_gYear
  dct_identifier:
  - UT:001017307000023
  dct_isPartOf:
  - http://id.crossref.org/issn/0018-9448
  - http://id.crossref.org/issn/1557-9654
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: 'Multiple packing: Lower bounds via infinite constellations@'
...