arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.04608math.COcs.ITmath.IT
收藏

关于线性完美Lee码的不存在性

On the nonexistence of linear perfect Lee codes

Tao Zhang, Yue Zhou

摘要:

1968年,Golomb和Welch证明了半径为$r\ge2$,维数为$n\ge3$的$\mathbb{Z}^{n}$中不存在完美Lee码.除了它自己的兴趣在编码理论和离散几何,这个猜想也密切相关的度直径问题的交换凯莱图。虽然关于这个问题的论文很多,但是Golomb-Welch猜想还远没有得到解决。本文通过引入一些新的代数方法证明了线性完美Lee码的不存在性。利用这些新的方法,我们证明了在$\mathbb{Z}^n$中,对于无穷多个维数值$n$,不存在半径为$r=2,3$的线性完美Lee码.特别地,除8例外,所有$3\le n\le 100$的$\mathbb{Z}^n$都不存在半径为$2$的线性完全Lee码。

英文摘要:

In 1968, Golomb and Welch conjectured that there does not exist perfect Lee code in $\mathbb{Z}^{n}$ with radius $r\ge2$ and dimension $n\ge3$. 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 $r=2,3$ in $\mathbb{Z}^n$ for infinitely many values of the dimension $n$. In particular, there does not exist linear perfect Lee codes of radius $2$ in $\mathbb{Z}^n$ for all $3\le n\le 100$ except 8 cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑