Difficulties Constructing Lattices with Exponential Kissing Number from Codes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916862010327040 |
|---|---|
| author | Bennett, Huck Golovnev, Alexander Stephens-Davidowitz, Noah |
| author_facet | Bennett, Huck Golovnev, Alexander Stephens-Davidowitz, Noah |
| contents | In this note, we present examples showing that several natural ways of constructing lattices from error-correcting codes do not in general yield a correspondence between minimum-weight non-zero codewords and shortest non-zero lattice vectors. From these examples, we conclude that the main results in two works of Vlăduţ (Moscow J. Comb. Number Th., 2019 and Discrete Comput. Geom., 2021) on constructing lattices with exponential kissing number from error-correcting codes are invalid. A more recent preprint (arXiv, 2024) that Vlăduţ posted after an initial version of this work was made public is also invalid.
Exhibiting a family of lattices with exponential kissing number therefore remains an open problem (as of July 2025). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_16660 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Difficulties Constructing Lattices with Exponential Kissing Number from Codes Bennett, Huck Golovnev, Alexander Stephens-Davidowitz, Noah Metric Geometry Information Theory Number Theory In this note, we present examples showing that several natural ways of constructing lattices from error-correcting codes do not in general yield a correspondence between minimum-weight non-zero codewords and shortest non-zero lattice vectors. From these examples, we conclude that the main results in two works of Vlăduţ (Moscow J. Comb. Number Th., 2019 and Discrete Comput. Geom., 2021) on constructing lattices with exponential kissing number from error-correcting codes are invalid. A more recent preprint (arXiv, 2024) that Vlăduţ posted after an initial version of this work was made public is also invalid. Exhibiting a family of lattices with exponential kissing number therefore remains an open problem (as of July 2025). |
| title | Difficulties Constructing Lattices with Exponential Kissing Number from Codes |
| topic | Metric Geometry Information Theory Number Theory |
| url | https://arxiv.org/abs/2410.16660 |