On perfect Lee codes

被引：35
|
作者：
Horak, P. [1 ]
机构：
[1] Univ Washington, Tacoma, WA 98402 USA
来源：
DISCRETE MATHEMATICS | 2009年 / 309卷 / 18期
关键词：
Perfect Lee code; Golomb-Welch conjecture; DISTANCE CODES; NONEXISTENCE; ALPHABETS; TILINGS;
D O I：
10.1016/j.disc.2008.03.019
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper we survey recent results on the Golomb-Welch conjecture and its generalizations and variations. We also show that there are no perfect 2-error correcting Lee codes of block length 5 and 6 over Z. This provides additional support for the Golomb Welch conjecture as it settles the two smallest cases open so far. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：5551 / 5561
页数：11
相关论文
共 50 条
12345