BibTeX
CSL-JSON
MLA
Harvard
Product Constructions for Perfect Lee Codes
release_obey2feceve7jixcht6ar7adgu
by
Tuvi Etzion
Released
as a article
.
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 forty 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 the Manhattan metrics
are also discussed.
In text/plain format
Archived Files and Locations
application/pdf
199.1 kB
file_ivm4szi7lva67dshjgrghlfn74
|
arxiv.org (repository) web.archive.org (webarchive) |
application/pdf
193.5 kB
file_7uvnmj5dozd5ni3rzcz2ckomhq
|
web.archive.org (webarchive) archive.org (archive) core.ac.uk (web) arxiv.org (repository) |
Read Archived PDF
Preserved and Accessible
arXiv
1103.3933v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links