Frontend
On the Kissing Number of Craig's Lattice and Spherical List Decoding
arXiv math.IT0 views
arXiv:2611.22441v1 Announce Type: new Abstract: Craig's lattices $A_{p-1}^k$ are a family of lattices with large kissing numbers, i.e., relative to their dimension $n = p-1$, they contain a large number of shortest nonzero vectors. Specifically, for small $k = o(\log p / \log \log p)$, a lower bound of Bacher (2015) shows that $A_{p-1}^k$ has a super-polynomial kissing number of $\omega(n^k)$. 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 $45^\circ$. Our second main result shows that Bacher's lower bound is asymptotically tight for $k = o(\log p / \log \log p)$. Finally, we introduce an efficient algorithm for computing the kissing number of $A_{p-1}^k$. 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 $A_{p-1}^k$ with $k \approx \sqrt{p}$ grows like $e^{\Theta(\sqrt{n})}$ in dimension $n=p-1$. Concurrent work by Laarhoven and Kominers as well as Bennett, Hhan, Li and Stephens-Davidowitz proves such a bound for very closely related lattices.
Source:https://arxiv.org/abs/2611.22441PreviousNoise Characterization and Robust Signal Detection in Yeast Pheromone Molecular CommunicationNextConstructions of reversible linear and DNA codes through $T_{D,g}^n-$set and $(n_1,c_1|n_2,c_2)-$right polycyclic codes
Related posts
How I built phone continuity for my desktop AI companion: 2-minute pairing codes, a 4-file browser, and 0 native-app installs
0dev.to
How Sendclap takes crypto payments without holding the money: USDC on Base, 1% in the contract
0dev.to
Dual-Licensing an Asset Library in 2026: GPLv3, Commercial Waivers, and Zero Runtime DRM
0dev.to OpenSource

Polymorphism in Programming Languages
0dev.to Programming
Don’t Let Raw Sensor Counts Leak Into Control Logic
0dev.to Programming

How to Run a Free Website SEO Audit in 5 Minutes (Core Web Vitals and AI Readiness Included)
0dev.to Programming