32 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
发表信息:
Journal of Combinatorial Theory series A 165: 225-257, 2019
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.
Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes
局部可修复码(LRC)是用于分布式数据存储的纠错码。除了全局级别外,它们还可以在本地纠正错误,从而减少存储节点之间的通信需求。几乎仿射LRC和拟阵理论之间有着密切的联系,拟阵理论可以用来构造好的LRC,并推导出它们的性能上界。[N]给出了带参数$(n,k,d,r,δ)$的线性LRC的广义Singleton界。Prakash等人,“具有局部纠错特性的最优线性码”,IEEE国际研讨会。信息理论]。在本文中,达到这个界限的LRC被称为完美的。[W.]中给出了线性完美$(n,k,d,r,δ)$ -LRC存在和不存在的结果。Song等人,“最优局部可修复代码”,IEEE J. Sel. Areas Comm.]。利用拟阵理论,这些存在性和不存在性结果后来在[T. Westerbeck等人,“On the Combinatorics of Locally Repairable Codes”,Arxiv:1501.00153],其还提供了具有参数$(n,k,r,δ)$的线性LRC可以具有的最大可实现最小距离$d_{\rm{max}}(n,k,r,δ)$的一般下界。本文扩展了存在完美线性LRC的参数类$(n,k,d,r,δ)$,并改进了$d_{\rm{max}}(n,k,r,δ)$的下界.此外,这个界被证明是最佳的拟阵类,用于推导线性LRC的存在界。