NEW LOWER BOUNDS FOR BINARY COVERING CODES

被引：8
|
作者：
LI, DF [1 ]
CHEN, W [1 ]
机构：
[1] ACAD SINICA, INST SYST SCI, BEIJING 100080, PEOPLES R CHINA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1994年 / 40卷 / 04期
关键词：
COVERING CODE; MULTIEXCESS; R-EXCESS; LINEAR INEQUALITY;
D O I：
10.1109/18.335963
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Lower bounds for K(n,R), the minimal number of codewords of any binary code of length n and covering radius R, are improved. The definition of multiexcess is introduced. A technique combining van Wee's method and linear inequalities for covering codes is used. A revised table for K(n,R) (n less-than-or-equal-to 33, R less-than-or-equal-to 10) is given.
引用
下载
收藏
页码：1122 / 1129
页数：8
相关论文
共 50 条
12345