Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Stein, S. Szabó (2009)
Algebra and Tiling by Sherman K. Stein
R. Roth, P. Siegel (1994)
Lee-metric BCH codes and their application to constrained and partial-response channelsIEEE Trans. Inf. Theory, 40
P. Horák, O. Grošek (2012)
A new approach towards the Golomb-Welch conjectureEur. J. Comb., 38
(2013)
Some insights about PL(7, 2) codes, In: ATINER’S Conference Paper Series, No: MAT2013-0476
Peter Horák (2009)
Tilings in Lee metricEur. J. Comb., 30
Simon Spacapan (2007)
Optimal Lee-Type Local Structures in Cartesian Products of Cycles and PathsSIAM J. Discret. Math., 21
T. Etzion, Eitan Yaakobi (2007)
Error-Correction of Multidimensional BurstsIEEE Transactions on Information Theory, 55
Sylvain Gravier, M. Mollard, C. Payan (1998)
On the Non-existence of 3-Dimensional Tiling in the Lee MetricEur. J. Comb., 19
Some insights about PL( , ) codes
C. Lee (1958)
Some properties of nonbinary error-correcting codesIRE Trans. Inf. Theory, 4
Simon Spacapan (2007)
Nonexistence of face-to-face four-dimensional tilings in the Lee metricEur. J. Comb., 28
(1968)
Algebraic coding and the Lee metric
K. Post (1975)
Nonexistence Theorems on Perfect Lee Codes over Large AlphabetsInf. Control., 29
M. Blaum, Jehoshua Bruck, A. Vardy (1998)
Interleaving Schemes for Multidimensional Cluster ErrorsIEEE Trans. Inf. Theory, 44
(2007)
Non-existence of face-to-face four dimensional tiling in the Lee metric
S. Golomb, L. Welch (1970)
Perfect Codes in the Lee Metric and the Packing of PolyominoesSiam Journal on Applied Mathematics, 18
Sylvain Gravier, M. Mollard, C. Payan (2001)
On the nonexistence of three-dimensional tiling in the Lee metric IIDiscret. Math., 235
(1968)
Algebraic coding and the Lee metric, In: Error Correcting
P. Horák (2009)
On perfect Lee codesDiscret. Math., 309
A. Barg, A. Mazumdar (2009)
Codes in permutations and error correction for rank modulation2010 IEEE International Symposium on Information Theory
AbstractThe Golomb-Welch conjecture states that there is no perfect r-error correcting Lee code of word length n over ℤ for n ≥ 3 and r ≥ 2. This problem has received great attention due to its importance in applications in several areas beyond mathematics and computer sciences. Many results on this subject have been achieved, however the conjecture is only solved for some particular values of n and r, namely: 3 ≤ n ≤ 5 and r ≥ 2; n = 6 and r = 2. Here we give an important contribution for the case n = 7 and r = 2, establishing cardinality restrictions on codeword sets.
Open Mathematics – de Gruyter
Published: Apr 2, 2018
Keywords: Perfect Lee codes; Golomb-Welch conjecture; Space tilings; 05B40; 05E99
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.