AbstractIn this paper we survey recent results on the Golomb–Welch conjecture and its generalizations and variations. We also show that there are no perfect 2-error correcting Lee codes of block length 5 and 6 over Z. This provides additional support for the Golomb Welch conjecture as it settles the two smallest cases open so far
We investigate perfect codes in Zn in the ℓp metric. Upper bounds for the packing radius r of a line...
AbstractIn this paper, we obtain bounds on the number of parity check digits for Lee weight codes co...
The goal of this paper is twofold. The main one is to survey the latest results on the perfect and q...
AbstractIn this paper we survey recent results on the Golomb–Welch conjecture and its generalization...
In this paper we survey recent results on the Golomb–Welch conjecture and its generalizations and va...
The Golomb-Welch conjecture states that there is no perfect r-error correcting Lee code of word leng...
AbstractGravier et al. proved [S. Gravier, M. Mollard, Ch. Payan, On the existence of three-dimensio...
The Golomb-Welch conjecture states that there is no perfect r-error correcting Lee code of word leng...
More than 50 years ago, Golomb and Welch conjectured that there is no perfect Lee codes $C$ of packi...
Perfect codes in the Lee metric are proved to be impossible for (3⩽n⩽5;e⩾n−1;q⩾2e+1) and (n⩾6;e⩾12n2...
Since 1968, when the Golomb–Welch conjecture was raised, it has become the main motive power behind ...
It is conjectured by Golomb and Welch around half a century ago that there is no perfect Lee codes $...
The Golomb-Welch conjecture states that there is no perfect r-error correcting Lee code of word leng...
AbstractLee-codes, correcting e-errors, over an alphabet with q = 2m letters are considered. It is p...
The Elias-bound in the Lee-metric is modified to improve the known bounds for the code parameters in...
We investigate perfect codes in Zn in the ℓp metric. Upper bounds for the packing radius r of a line...
AbstractIn this paper, we obtain bounds on the number of parity check digits for Lee weight codes co...
The goal of this paper is twofold. The main one is to survey the latest results on the perfect and q...
AbstractIn this paper we survey recent results on the Golomb–Welch conjecture and its generalization...
In this paper we survey recent results on the Golomb–Welch conjecture and its generalizations and va...
The Golomb-Welch conjecture states that there is no perfect r-error correcting Lee code of word leng...
AbstractGravier et al. proved [S. Gravier, M. Mollard, Ch. Payan, On the existence of three-dimensio...
The Golomb-Welch conjecture states that there is no perfect r-error correcting Lee code of word leng...
More than 50 years ago, Golomb and Welch conjectured that there is no perfect Lee codes $C$ of packi...
Perfect codes in the Lee metric are proved to be impossible for (3⩽n⩽5;e⩾n−1;q⩾2e+1) and (n⩾6;e⩾12n2...
Since 1968, when the Golomb–Welch conjecture was raised, it has become the main motive power behind ...
It is conjectured by Golomb and Welch around half a century ago that there is no perfect Lee codes $...
The Golomb-Welch conjecture states that there is no perfect r-error correcting Lee code of word leng...
AbstractLee-codes, correcting e-errors, over an alphabet with q = 2m letters are considered. It is p...
The Elias-bound in the Lee-metric is modified to improve the known bounds for the code parameters in...
We investigate perfect codes in Zn in the ℓp metric. Upper bounds for the packing radius r of a line...
AbstractIn this paper, we obtain bounds on the number of parity check digits for Lee weight codes co...
The goal of this paper is twofold. The main one is to survey the latest results on the perfect and q...
DOI
Add to ORKG