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 363 Free Web Calculators with Next.js & Tailwind (Zero Ads, Instant Math)
0dev.to
Our team name generator draws 6 of 110 names uniformly, and you will still see a repeat by the third press
0dev.to
HotSymbol: A Simple Way to Find, Copy, and Use Thousands of Symbols Online
0dev.to
No Webfonts, No Frameworks: The Performance Budget I Keep on My Tool Pages
0dev.to
How the Turkish ID number (TCKN) checksum works, with validators in JavaScript, Python and PHP
0dev.to
Our homepage demo has four numbers for one score, and an ordinal suffix with three branches that can never run
0dev.to