On the lower bound for kissing numbers of $\ell_p$-spheres in high dimensions
Chengfei Xie, Gennian Ge
TL;DR
This paper establishes new lower bounds for the kissing number of lex-spheres in high dimensions, improving previous results by leveraging coding theory techniques.
Contribution
It introduces novel lower bounds for lex-sphere kissing numbers using coding theory, advancing the understanding of sphere packings in high-dimensional spaces.
Findings
New lower bounds for lex-sphere kissing numbers
Improved results over previous bounds by Xu (2007)
Application of coding theory to geometric packing problems
Abstract
In this paper, we give some new lower bounds for the kissing number of -spheres. These results improve the previous work due to Xu (2007). Our method is based on coding theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Point processes and geometric inequalities · Limits and Structures in Graph Theory