On the nonexistence of linear perfect Lee codes
arXiv:1802.04608 · doi:10.1016/j.jcta.2019.02.008
Abstract
In 1968, Golomb and Welch conjectured that there does not exist perfect Lee code in with radius and dimension . Besides its own interest in coding theory and discrete geometry, this conjecture is also strongly related to the degree-diameter problems of abelian Cayley graphs. Although there are many papers on this topic, the Golomb-Welch conjecture is far from being solved. In this paper, we prove the nonexistence of linear perfect Lee codes by introducing some new algebraic methods. Using these new methods, we show the nonexistence of linear perfect Lee codes of radii in for infinitely many values of the dimension . In particular, there does not exist linear perfect Lee codes of radius in for all except 8 cases.
arXiv comment32 pages, 1 figure, 5 Tables. Compared with the previous edition, we have added a new subsection 2.1 on linear perfect Lee codes and degree-diameter problem with more details to explain the link between the Cayley graph and the homomorphism-induced structure of the Lee sphere
References in corpus (7)
- The degree-diameter problem for several varieties of Cayley graphs, I: the Abelian case
- A New Approach Towards the Golomb-Welch Conjecture
- Diameter Perfect Lee Codes
- Nonexistence of perfect -error-correcting Lee codes in certain dimensions
- 50 Years of the Golomb--Welch Conjecture
- Quasi-perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension
- Cayley graphs of diameter two with order greater than 0.684 of the Moore bound for any degree