Back to Search
Start Over
Product Constructions for Perfect Lee Codes.
- Source :
- IEEE Transactions on Information Theory; Nov2011, Vol. 57 Issue 11, p7473-7481, 9p
- Publication Year :
- 2011
-
Abstract
- A well-known conjecture of Golomb and Welch is that the only nontrivial perfect codes in the Lee and Manhattan metrics have length two or minimum distance three. This problem and related topics were subject for extensive research in the last 40 years. In this paper, two product constructions for perfect Lee codes and diameter perfect Lee codes are presented. These constructions yield a large number of nonlinear perfect codes and nonlinear diameter perfect codes in the Lee and Manhattan metrics. A short survey and other related problems on perfect codes in the Lee and Manhattan metrics are also discussed. [ABSTRACT FROM AUTHOR]
- Subjects :
- CODING theory
LATTICE theory
LINEAR systems
MANGANESE
ZINC
MEASUREMENT
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 57
- Issue :
- 11
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 67194824
- Full Text :
- https://doi.org/10.1109/TIT.2011.2161133