Andrew Salmon

activity

20142026

most citedThree-point bounds for sphere packing

7 citations · 11 across the 10 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

The Rate of the Delsarte Bound for Binary Codes and Spheres

Andrew Salmon

We give the asymptotic rate of Delsarte's linear programming bound for binary codes and spherical codes. This extends previous work of the author which formulated and proved an ana…

math.CO2026

The half-rate linear programming bound for binary codes is $\frac{1}{2} - \frac{1}{π}$

Andrew Salmon

In their work on sphere packing and the modular bootstrap, Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini conjectured the exact high-dimensional exponent of the Cohn-Elkies sph…

math.MG2026

Linear Programming Bounds for Fibered Sphere Packings

Andrew Salmon

We study linear programming (LP) bounds for sphere packings that fiber over translates of a fixed lattice of lower rank, as well as their dual formulations. In doing so, we place t…

The Rate of the Delsarte Bound for Binary Codes and Spheres

The half-rate linear programming bound for binary codes is 21​−π1​

Linear Programming Bounds for Fibered Sphere Packings

The half-rate linear programming bound for binary codes is $\frac{1}{2} - \frac{1}{π}$