solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看331次
Quasi-perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension. (arXiv:1412.5797v4 [cs.IT] UPDATED)
来源于:arXiv
A construction of 2-quasi-perfect Lee codes is given over the space $\mathbb
Z_p^n$ for $p$ prime, $p\equiv \pm 5\pmod{12}$ and $n=2[\frac{p}{4}]$. It is
known that there are infinitely many such primes. Golomb and Welch conjectured
that perfect codes for the Lee-metric do not exist for dimension $n\geq 3$ and
radius $r\geq 2$. This conjecture was proved to be true for large radii as well
as for low dimensions. The codes found are very close to be perfect, which
exhibits the hardness of the conjecture. A series of computations show that
related graphs are Ramanujan, which could provide further connections between
Coding and Graph Theories. 查看全文>>