论文信息 - Nonexistence of perfect 2-error-correcting Lee codes in certain dimensions

Nonexistence of perfect 2-error-correcting Lee codes in certain dimensions

The GolombWelch conjecture states that there are no perfect e-error-correcting codes in Zn for n3 and e2. In this note, we prove the nonexistence of perfect 2-error-correcting codes for a certain class of n, which is expected to be infinite. This result further substantiates the GolombWelch conjecture.

Dongryul Kim

[1] Simon Špacapan,et al. Nonexistence of face-to-face four-dimensional tilings in the Lee metric , 2007, Eur. J. Comb..

[2] Sylvain Gravier,et al. On the Non-existence of 3-Dimensional Tiling in the Lee Metric , 1998, Eur. J. Comb..

[3] R. Horn,et al. A heuristic asymptotic formula concerning the distribution of prime numbers , 1962 .

[4] Mario Szegedy,et al. Algorithms to tile the infinite grid with finite clusters , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5] Karel A. Post. Nonexistence Theorems on Perfect Lee Codes over Large Alphabets , 1975, Inf. Control..

[6] Peter Horák,et al. A new approach towards the Golomb-Welch conjecture , 2014, Eur. J. Comb..

[7] S. Golomb,et al. Perfect Codes in the Lee Metric and the Packing of Polyominoes , 1970 .

[8] P. Horak. Tilings in Lee metric , 2009, Eur. J. Comb..

[9] Timo Lepistö. A Modification of the Elias-Bound and Nontexistence Theorems for Perfect Codes in the Lee-Metric , 1981, Inf. Control..

[10] P. Horak. On perfect Lee codes , 2009, Discret. Math..