Multiple Packing: Lower Bounds via Error Exponents

11/08/2022
by   Yihan Zhang, et al.
0

We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. Multiple packing is a natural generalization of the sphere packing problem. For any N>0 and L∈ℤ_≥2, a multiple packing is a set 𝒞 of points in ℝ^n such that any point in ℝ^n lies in the intersection of at most L-1 balls of radius √(nN) around points in 𝒞. We study this problem for both bounded point sets whose points have norm at most √(nP) for some constant P>0 and unbounded point sets whose points are allowed to be anywhere in ℝ^n. 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. We derive the best known lower bounds on the optimal multiple packing density. This is accomplished by establishing a curious inequality which relates the list-decoding error exponent for additive white Gaussian noise channels, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We also derive various bounds on the list-decoding error exponent in both bounded and unbounded settings which are of independent interest beyond multiple packing.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset