Perfect single error-correcting codes in the Johnson scheme

被引：8
|
作者：
Gordon, Daniel M. [1 ]
机构：
[1] IDA Ctr Commun Res, San Diego, CA 92121 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2006年 / 52卷 / 10期
关键词：
constant-weight codes; Johnson scheme; perfect codes;
D O I：
10.1109/TIT.2006.881744
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Delsarte conjectured in 1973 that there are no nontrivial pefect codes in the Johnson scheme. Etzion and Schwartz recently showed that perfect codes must be k-regular for large k, and used this to show that there are no perfect codes correcting single errors in J(n, w) for n <= 50 000. In this correspondence we show that there are no perfect single error-correcting codes for n <= 2(250).
引用
收藏
页码：4670 / 4672
页数：3
相关论文
共 50 条
12345