Golomb–Welch conjecture on perfect Lee codes
Golomb–Welch conjecture on perfect Lee codes
Let be the ambient Lee-metric space, and let a perfect -Lee code be a Lee code with codewords whose packing and covering radii coincide. Golomb–Welch conjecture. If is odd, then there exist no perfect -Lee codes for
The conjecture concerns the existence of perfect tilings by Lee-metric balls and has been studied since Golomb and Welch's formulation. The source gives no resolution, so the conjecture remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Aida Abiad, Alessandro Neri and Luuk Reijnders, “Eigenvalue bounds for the distance-t chromatic number of a graph and their application to Lee codes”, arXiv:2404.14839 (2024).
Additional references
8 papers in this index state this conjecture (2011–2024). The statement above is taken from the most recent of them; the others are arXiv:2212.12212, arXiv:1808.08520, arXiv:1802.04608, arXiv:1701.08412, arXiv:1603.00051, arXiv:1206.4436, arXiv:1109.3475.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.