Golomb–Welch conjecture
For every integer dimension and every integer radius , there is no set such that is tiled by translates of the Lee ball ; equivalently, does not hold.
References
- On the Lattice Tilings by Lee Balls: Q-Polynomials, Group-Ring Equations, and a Decision Algorithm — arXiv — Ang Xiao, Yue Zhou
Source: arXiv
Progress summary
A new October 2026 paper strengthens the lattice case, but the full conjecture remains open.
Golomb and Welch posed the conjecture in 1968: in its strong form, no perfect Lee code exists for and . The unrestricted non-lattice problem is unresolved.
Known results
- The conjecture is proved for and all (survey, 2017).
- No linear codes exist for (survey, 2017).
- No lattice tiling by radius- Lee spheres exists for any ; hence the conjecture holds when is prime (2018).
- Linear radius- codes are excluded for except eight dimensions (2018).
October 2026 lattice-tiling advance
Ang Xiao and Yue Zhou derive group-ring conditions and combine them with a decision algorithm for lattice Lee-ball tilings, yielding broad new exclusions and a narrower computationally accessible case. This is claimed progress for the lattice setting, not a resolution of the full conjecture.
Current status (as of October 2026): substantial lattice and low-dimensional cases are settled, while the unrestricted Golomb–Welch conjecture remains open.
Solutions 0
No solutions have been posted yet.