AbstractIn this paper we study an analogue of perfect codes: codes that perfectly correct errors of limited size, assuming that there is a bound on the number of these errors
AbstractLee-codes, correcting e-errors, over an alphabet with q = 2m letters are considered. It is p...
AbstractA class of binary codes, satisfying the equality in a specialized version of the Johnson bou...
The Elias-bound in the Lee-metric is modified to improve the known bounds for the code parameters in...
AbstractIn this paper we study an analogue of perfect codes: codes that perfectly correct errors of ...
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...
AbstractKabatyanskii and Panchenko asked whether two sets of size 10 consisting of binary 7-tuples e...
AbstractTwo theorems are proved on perfect codes. The first one states that Lloyd's theorem is true ...
The existence of perfect double error-correcting codes on q symbols (q ≧ 2) is discussed. (i) Refere...
AbstractThis short paper treats the perfect codes, in the case of arithmetic codes and Garcia-Rao mo...
AbstractStarting with a single-error-correcting extended perfect binary systematic code of length S,...
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
We generalize the concept of perfect Lee-error-correcting codes, and present constructions of this n...
AbstractWe consider codes C for which the decoding regions for codewords c are balls Bρ(c), where ρ ...
AbstractIn this paper we survey recent results on the Golomb–Welch conjecture and its generalization...
There are two well-known necessary conditions for the existence of a perfect error-correcting code. ...
AbstractLee-codes, correcting e-errors, over an alphabet with q = 2m letters are considered. It is p...
AbstractA class of binary codes, satisfying the equality in a specialized version of the Johnson bou...
The Elias-bound in the Lee-metric is modified to improve the known bounds for the code parameters in...
AbstractIn this paper we study an analogue of perfect codes: codes that perfectly correct errors of ...
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...
AbstractKabatyanskii and Panchenko asked whether two sets of size 10 consisting of binary 7-tuples e...
AbstractTwo theorems are proved on perfect codes. The first one states that Lloyd's theorem is true ...
The existence of perfect double error-correcting codes on q symbols (q ≧ 2) is discussed. (i) Refere...
AbstractThis short paper treats the perfect codes, in the case of arithmetic codes and Garcia-Rao mo...
AbstractStarting with a single-error-correcting extended perfect binary systematic code of length S,...
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
We generalize the concept of perfect Lee-error-correcting codes, and present constructions of this n...
AbstractWe consider codes C for which the decoding regions for codewords c are balls Bρ(c), where ρ ...
AbstractIn this paper we survey recent results on the Golomb–Welch conjecture and its generalization...
There are two well-known necessary conditions for the existence of a perfect error-correcting code. ...
AbstractLee-codes, correcting e-errors, over an alphabet with q = 2m letters are considered. It is p...
AbstractA class of binary codes, satisfying the equality in a specialized version of the Johnson bou...
The Elias-bound in the Lee-metric is modified to improve the known bounds for the code parameters in...
DOI
Add to ORKG