Papers
Topics
Authors
Recent
Search
2000 character limit reached

Multiple Packing: Lower Bounds via Error Exponents

Published 8 Nov 2022 in math.MG, cs.IT, and math.IT | (2211.04408v2)

Abstract: 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 N>0 and L∈Z≥2 L\in\mathbb{Z}_{\ge2} , a multiple packing is a set C\mathcal{C} of points in Rn \mathbb{R}^n such that any point in Rn \mathbb{R}^n lies in the intersection of at most L−1 L-1 balls of radius nN \sqrt{nN} around points in C \mathcal{C} . We study this problem for both bounded point sets whose points have norm at most nP\sqrt{nP} for some constant P>0P>0 and unbounded point sets whose points are allowed to be anywhere in Rn \mathbb{R}^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.

Authors (2)
Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.