Diameter Perfect Lee Codes
Preprint
Abstract
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 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\geq3 there are unaccountably many diameter-4 perfect Lee codes of word length n over Z. This is in a strict contrast with perfect error-correcting Lee codes of word length n over Z as there is a unique such code for n=3, and its is conjectured that this is always the case when 2n+1 is a prime. Diameter perfect Lee codes will be constructed by an algebraic construction that is based on a group homomorphism. This will allow us to design an efficient algorithm for their decoding.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Quasi-Cross Lattice Tilings With Applications to Flash MemoryIEEE Transactions on Information Theory, 2011
- Product Constructions for Perfect Lee CodesIEEE Transactions on Information Theory, 2011
- On perfect Lee codesDiscrete Mathematics, 2009
- Tilings in Lee metricEuropean Journal of Combinatorics, 2009
- Lectures on Advances in Combinatorics2008
- Graphs, Tessellations, and Perfect Codes on Flat ToriIEEE Transactions on Information Theory, 2004
- On the Non-existence of 3-Dimensional Tiling in the Lee MetricEuropean Journal of Combinatorics, 1998
- On mosaics consisting of multidimensional crossesActa Mathematica Hungarica, 1981
- Nonexistence theorems on perfect Lee codes over large alphabetsInformation and Control, 1975
- Some properties of nonbinary error-correcting codesIEEE Transactions on Information Theory, 1958