arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.03361math.CO
收藏

关于填充半径为2的几乎完美线性Lee码

On almost perfect linear Lee codes of packing radius 2

Xiaodong Xu, Yue Zhou

摘要:

早在50多年前,Golomb和Welch就指出,对于$r\geq2$和$n\geq 3$,在$\mathbb{Z}^{n}$中不存在填充半径为$r$的完美Lee码$C$。最近,Leung和第二作者证明了如果$C$是线性的,那么Golomb-Welch猜想对$r=2$和$n\geq 3$成立。本文考虑线性Lee码的次佳分类,即用Lee球$S(n,r)$填充$\mathbb{Z}^n$的密度等于$\frac{|S(n,r)|}{|S(n,r)|+1}$ .我们表明,对于$r=2$和$n\equiv 0,3,4 \pmod{6}$,这种包装密度永远无法实现。

英文摘要:

More than 50 years ago, Golomb and Welch conjectured that there is no perfect Lee codes $C$ of packing radius $r$ in $\mathbb{Z}^{n}$ for $r\geq2$ and $n\geq 3$. Recently, Leung and the second author proved that if $C$ is linear, then the Golomb-Welch conjecture is valid for $r=2$ and $n\geq 3$. In this paper, we consider the classification of linear Lee codes with the second-best possibility, that is the density of the lattice packing of $\mathbb{Z}^n$ by Lee spheres $S(n,r)$ equals $\frac{|S(n,r)|}{|S(n,r)|+1}$. We show that, for $r=2$ and $n\equiv 0,3,4 \pmod{6}$, this packing density can never be achieved.

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

↑