On kissing numbers and spherical codes in high dimensions
Metric Geometry
2018-07-10 v2 Combinatorics
Probability
Abstract
We prove a lower bound of on the kissing number in dimension . This improves the classical lower bound of Chabauty, Shannon, and Wyner by a linear factor in the dimension. We obtain a similar linear factor improvement to the best known lower bound on the maximal size of a spherical code of acute angle in high dimensions.
Cite
@article{arxiv.1803.02702,
title = {On kissing numbers and spherical codes in high dimensions},
author = {Matthew Jenssen and Felix Joos and Will Perkins},
journal= {arXiv preprint arXiv:1803.02702},
year = {2018}
}