← 研踪 PaperTrailarXiv:2611.22441 · v1
On the Kissing Number of Craig's Lattice and Spherical List Decoding
首次提交 2026-11-17 17:12
版本更新 2026-11-17 17:12
雷达观测 2026-11-18 19:42
摘要
Craig's lattices are a family of lattices with large kissing numbers, i.e., relative to their dimension , they contain a large number of shortest nonzero vectors. Specifically, for small , a lower bound of Bacher (2015) shows that has a super-polynomial kissing number of . Craig's lattices are therefore attractive candidates for the construction of spherical codes. In this work, we introduce a polynomial-time list decoder for spherical codes obtained from Craig's lattices for angular distance below . Our second main result shows that Bacher's lower bound is asymptotically tight for . Finally, we introduce an efficient algorithm for computing the kissing number of . Using this algorithm, we compute their kissing number in dimensions up to 521. Based on this data, we pose the open question whether the kissing number of with grows like in dimension . Concurrent work by Laarhoven and Kominers as well as Bennett, Hhan, Li and Stephens-Davidowitz proves such a bound for very closely related lattices.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 17:12 · 最新观测版本
On the Kissing Number of Craig's Lattice and Spherical List Decoding
Craig's lattices are a family of lattices with large kissing numbers, i.e., relative to their dimension , they contain a large number of shortest nonzero vectors. Specifically, for small , a lower bound of Bacher (2015) shows that has a super-polynomial kissing number of . Craig's lattices are therefore attractive candidates for the construction of spherical codes. In this work, we introduce a polynomial-time list decoder for spherical codes obtained from Craig's lattices for angular distance below . Our second main result shows that Bacher's lower bound is asymptotically tight for . Finally, we introduce an efficient algorithm for computing the kissing number of . Using this algorithm, we compute their kissing number in dimensions up to 521. Based on this data, we pose the open question whether the kissing number of with grows like in dimension . Concurrent work by Laarhoven and Kominers as well as Bennett, Hhan, Li and Stephens-Davidowitz proves such a bound for very closely related lattices.
查看此版本解读 →查看此版本原文 ↗