2000 character limit reached
Nonexistence of perfect $2$-error-correcting Lee codes in certain dimensions
Published 29 Jan 2017 in math.CO | (1701.08412v3)
Abstract: The Golomb--Welch conjecture states that there are no perfect $e$-error-correcting codes in $\mathbb{Z}n$ for $n \ge 3$ and $e \ge 2$. In this note, we prove the nonexistence of perfect $2$-error-correcting codes for a certain class of $n$, which is expected to be infinite. This result further substantiates the Golomb--Welch conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.