Math 2.0

Resources / preprint

Multiple Packing: Lower Bounds via Infinite Constellations XCZS191H6Q

URIm2://res/XCZS191H6Q
Kindpreprint
CreatorsYihan Zhang, Shashank Vatedka
Date2022-11-08
MSC51-XX, 52-XX, 94-XX
Subjectsarxiv math.MG, arxiv cs.IT, arxiv math.IT
Scopein

Expressions

e1: version, preprint

Languageen
Date2022-11-08
IdsarXiv 2211.04407

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
6YQVMEMKXYstatementtheorem 1arxiv
BA6NW601Y2statementtheorem 2arxiv
CP53E8HZZ0statementlemma 10arxiv
EYWBGNN65Hstatementtheorem 8arxiv
Change of variablestatementlemma 3arxiv
Chebyshev radius and average squared radius of a codedefinitiondefinition 3arxiv
Laplace's methodstatementtheorem 4arxiv
P08EYTGZ0Ystatementtheorem 5arxiv
Average-radius multiple packingdefinitiondefinition 4arxiv
Chebyshev radius and average squared radius of a listdefinitiondefinition 2arxiv
V6GFFEH3SEstatementtheorem 6arxiv
WP31WNQWTWstatementtheorem 7arxiv
Multiple packingdefinitiondefinition 1arxiv
YV3QK9Q8PQstatementlemma 9arxiv

Catalogue records