arXiv 1205.48752012-05cs.ITmath.IT

A New Approach Towards the Golomb-Welch Conjecture

Peter Horak, Otokar Grosek

DOI：: 10.1016/j.ejc.2013.10.010

英文摘要：

The Golomb-Welch conjecture deals with the existence of perfect $e$% -error correcting Lee codes of word length $n,$ $PL(n,e)$ codes. Although there are many papers on the topic, the conjecture is still far from being solved. In this paper we initiate the study of an invariant connected to abelian groups that enables us to reformulate the conjecture, and then to prove the non-existence of linear PL(n,2) codes for $n\leq 12$. Using this new approach we also construct the first quasi-perfect Lee codes for dimension $n=3,$ and show that, for fixed $n$, there are only finitely many such codes over $Z^n$.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

50 Years of the Golomb--Welch Conjecture

Since 1968, when the Golomb--Welch conjecture was raised, it has become the main motive power behind the progress in the area of the perfect Lee codes. Although there is a vast literature on the topic and it is widely believed to be true, this conjecture is far from being solved. In this paper, we provide a survey of papers on the Golomb--Welch conjecture. Further, new results on Golomb--Welch conjecture dealing with perfect Lee codes of large radii are presented. Algebraic ways of tackling the conjecture in the future are discussed as well. Finally, a brief survey of research inspired by the …

2018-01-20cs.ITmath.COmath.IT

On Disjoint Golomb Rulers

A set $\{a_i\:|\: 1\leq i \leq k\}$ of non-negative integers is a Golomb ruler if differences $a_i-a_j$, for any $i \neq j$, are all distinct. A set of $I$ disjoint Golomb rulers (DGR) each being a $J$-subset of $\{1,2,\cdots, n\}$ is called an $(I,J,n)-DGR$. Let $H(I, J)$ be the least positive $n$ such that there is an $(I,J,n)-DGR$. In this paper, we propose a series of conjectures on the constructions and structures of DGR. The main conjecture states that if $A$ is any set of positive integers such that $|A| = H(I, J)$, then there are $I$ disjoint Golomb rulers, each being a $J$-subset of $…

2014-05-18cs.ITmath.IT

On the nonexistence of linear perfect Lee codes

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…

2019-02-27cs.ITmath.COmath.IT

Product Constructions for Perfect Lee Codes

A well known conjecture of Golomb and Welch is that the only nontrivial perfect codes in the Lee and Manhattan metrics have length two or minimum distance three. This problem and related topics were subject for extensive research in the last forty years. In this paper two product constructions for perfect Lee codes and diameter perfect Lee codes are presented. These constructions yield a large number of nonlinear perfect codes and nonlinear diameter perfect codes in the Lee and Manhattan metrics. A short survey and other related problems on perfect codes in the Lee and the Manhattan metrics ar…

2011-06-22cs.ITmath.IT

The set of dimensions for which there are no linear perfect 2-error-correcting Lee codes has positive density

The Golomb-Welch conjecture states that there are no perfect $e$-error-correcting Lee codes in $\mathbb{Z}^n$ ($PL(n,e)$-codes) whenever $n\geq 3$ and $e\geq 2$. A special case of this conjecture is when $e=2$. In a recent paper of A. Campello, S. Costa and the author of this paper, it is proved that the set $\mathcal{N}$ of dimensions $n\geq 3$ for which there are no linear $PL(n,2)$-codes is infinite and $\#\{n \in \mathcal{N}: n\leq x\} \geq \frac{x}{3\ln(x)/2} (1+o(1))$. In this paper we present a simple and elementary argument which allows to improve the above result to $\#\{n \in \mathca…

2018-04-24cs.ITmath.IT

Non-Archimedean Welch Bounds and Non-Archimedean Zauner Conjecture

Let $\mathbb{K}$ be a non-Archimedean (complete) valued field satisfying \begin{align*} \left|\sum_{j=1}^{n}λ_j^2\right|=\max_{1\leq j \leq n}|λ_j|^2, \quad \forall λ_j \in \mathbb{K}, 1\leq j \leq n, \forall n \in \mathbb{N}. \end{align*} For $d\in \mathbb{N}$, let $\mathbb{K}^d$ be the standard $d$-dimensional non-Archimedean Hilbert space. Let $m \in \mathbb{N}$ and $\text{Sym}^m(\mathbb{K}^d)$ be the non-Archimedean Hilbert space of symmetric m-tensors. We prove the following result. If $\{τ_j\}_{j=1}^n$ is a collection in $\mathbb{K}^d$ satisfying $\langle τ_j, τ_j\rangle =1$ for all $1\l…

2022-08-28cs.ITmath.FAmath.IT

更多相关论文收起更多论文

On the absolute irreducibility of hyperplane sections of generalized Fermat varieties in $\Bbb{P}^3$ and the conjecture on exceptional APN functions: the Kasami-Welch degree case

Let $f$ be a function on a finite field $F$. The decomposition of the generalized Fermat variety $X$ defined by the multivariate polynomial of degree $n$, $ϕ(x,y,z)=f(x)+f(y)+f(z)$ in $\Bbb{P}^3(\overline{\mathbb{F}}_2)$, plays a crucial role in the study of almost perfect non-linear (APN) functions and exceptional APN functions. Their structure depends fundamentally on the Fermat varieties corresponding to the monomial functions of exceptional degrees $n=2^k+1$ and $n=2^{2k}-2^k+1$ (Gold and Kasami-Welch numbers, respectively). Very important results for these have been obtained by Janwa, McG…

2016-12-18cs.CRcs.ITmath.AG

On linear diameter perfect Lee codes with diameter 6

In 1968, Golomb and Welch conjectured that there is no perfect Lee codes with radius $r\ge2$ and dimension $n\ge3$. A diameter perfect code is a natural generalization of the perfect code. In 2011, Etzion (IEEE Trans. Inform. Theory, 57(11): 7473--7481, 2011) proposed the following problem: Are there diameter perfect Lee (DPL, for short) codes with diameter greater than four besides the $DPL(3,6)$ code? Later, Horak and AlBdaiwi (IEEE Trans. Inform. Theory, 58(8): 5490--5499, 2012) conjectured that there are no $DPL(n,d)$ codes for dimension $n\ge3$ and diameter $d>4$ except for $(n,d)=(3,6)$.…

2022-12-23cs.ITmath.COmath.IT

A Generalization of Lee Codes

Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDSs constitute a generalization of perfect Lee codes, diameter perfect codes, as well as other codes and dominating sets. In this paper we initiate a systematic study of PDDSs. PDDSs related to the application will be constructed and the non-existence of some PDDSs will be shown. In addition, an extension of the long-standing Golomb-Welch conjecture, in terms of PDDS, will be stated. We note that all constructed PDDSs are lattice-like which is a very important featu…

2013-08-04cs.DMcs.ITmath.CO

Quasi-perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension

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…

2017-06-23cs.DMcs.ITmath.CO

The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs

Let $\Z_n[i]$ be the ring of Gaussian integers modulo a positive integer $n$. Very recently, Camarero and Martínez [IEEE Trans. Inform. Theory, {\bf 62} (2016), 1183--1192], showed that for every prime number $p>5$ such that $p\equiv \pm 5 \pmod{12}$, the Cayley graph $\mathcal{G}_p=\textnormal{Cay}(\Z_p[i], S_2)$, where $S_2$ is the set of units of $\Z_p[i]$, induces a 2-quasi-perfect Lee code over $\Z_p^m$, where $m=2\lfloor \frac{p}{4}\rfloor$. They also conjectured that $\mathcal{G}_p$ is a Ramanujan graph for every prime $p$ such that $p\equiv 3 \pmod{4}$. In this paper, we solve this con…

2020-10-12cs.ITmath.IT

Diameter Perfect Lee Codes

Lee codes have been intensively studied for more than 40 years. Interest in these codes has been triggered by the Golomb-Welch conjecture on the existence of the perfect error-correcting Lee codes. In this paper we deal with the existence and enumeration of diameter perfect Lee codes. As main results we determine all $q$ for which there exists a linear diameter-4 perfect Lee code of word length $n$ over $Z_{q},$ and prove that for each $n\geq 3$ there are uncountable many diameter-4 perfect Lee codes of word length $n$ over $Z.$ This is in a strict contrast with perfect error-correcting Lee co…

2012-04-13cs.ITmath.COmath.IT

Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields

Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes for radius $t=1$ or dimension $n=1, 2$. It is admitted that the existence and the construction of quasi-perfect Lee codes have to be studied since they are the best alternative to the perfect codes. In this paper we firstly highlight the relationships between subset sums, Cayley graphs, and Lee linear codes and present some results. Next, we present a new constructive method for constructing quasi-perfect Lee codes. Our approach uses subsets derived from some quadratic curves over finite fields (in odd characteristic)…

2016-08-24cs.ITmath.IT

On the non-existence of linear perfect Lee codes: The Zhang-Ge condition and a new polynomial criterion

The Golomb-Welch conjecture (1968) states that there are no $e$-perfect Lee codes in $\mathbb{Z}^n$ for $n\geq 3$ and $e\geq 2$. This conjecture remains open even for linear codes. A recent result of Zhang and Ge establishes the non-existence of linear $e$-perfect Lee codes in $\mathbb{Z}^n$ for infinitely many dimensions $n$, for $e=3$ and $4$. In this paper we extend this result in two ways. First, using the non-existence criterion of Zhang and Ge together with a generalized version of Lucas' theorem we extend the above result for almost all $e$ (i.e. a subset of positive integers with densi…

2018-09-24cs.DMcs.ITmath.CO