LINEAR INEQUALITIES FOR COVERING CODES .1. PAIR COVERING INEQUALITIES

被引：0
作者：
ZHEN, Z
机构：
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 03期
关键词：
COVERING; CODING; ASSOCIATION SCHEME; LINEAR INEQUALITY;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The lower bounds on K(n, R), minimum number of codewords of any binary code of length n, and covering radius R are improved. A new technique combining the Hamming association scheme and the results of a classic problem of covering pairs by k-tuples is introduced. This new method leads to improvement of the lower bounds on K(n, R) for over 80 pairs of values of n and R within the range of n less-than-or-equal-to 33 and R with the range of n less-than-or-equal-to 33 and R less-than-or-equal-to 10.
引用
收藏
页码：573 / 582
页数：10
相关论文
共 34 条
[1]   INEQUALITIES FOR COVERING CODES [J].
CALDERBANK, AR ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1276-1280
[2]   FURTHER RESULTS ON THE COVERING RADIUS OF CODES [J].
COHEN, GD ;
LOBSTEIN, AC ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (05) :680-694
[3]   COVERING RADIUS - SURVEY AND RECENT RESULTS [J].
COHEN, GD ;
KARPOVSKY, MG ;
MATTSON, HF ;
SCHATZ, JR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :328-343
[4]  
COHEN GD, 1986, 1984 P INT C ALG ALG
[5]  
DICKSON TJ, 1971, J LOND MATH SOC, V3, P222
[6]   THE FOOTBALL POOL PROBLEM FOR 7-MATCHES AND 8-MATCHES [J].
FERNANDES, H ;
RECHTSCHAFFEN, E .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1983, 35 (01) :109-114
[7]  
Fort M. K., 1958, PAC J MATH, V8, P709
[8]   ON THE COVERING RADIUS OF CODES [J].
GRAHAM, RL ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :385-401
[9]  
HANANI H, 1960, CAN J MATH, V12, P145, DOI [10.4153/CJM-1960-013-3, DOI 10.4153/CJM-1960-013-3]
[10]   A NEW CONSTRUCTION FOR COVERING CODES [J].
HONKALA, IS ;
HAMALAINEN, HO .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1343-1344
1234