NEW UPPER BOUNDS ON RATE OF A CODE VIA DELSARTE-MACWILLIAMS INEQUALITIES

被引:280
作者
MCELIECE, RJ
RODEMICH, ER
RUMSEY, H
WELCH, LR
机构
[1] CALTECH,JET PROP LAB,PASADENA,CA 91103
[2] UNIV SO CALIF,LOS ANGELES,CA 90007
关键词
D O I
10.1109/TIT.1977.1055688
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:157 / 166
页数:10
相关论文
共 8 条
[1]  
ASKEY R, 1975, SIAMS REGIONAL C LEC, V21
[2]  
BERLEKAMP ER, 1968, ALGEBRAIC CODING THE
[3]  
DELSARTE P, 1973, 10 PHIL RES REP SUPP
[4]  
KARLIN S, 1961, SCRIPTA MATH, V26, P33
[5]   MINIMAL REDUNDANCY OF BINARY ERROR-CORRECTING CODES [J].
LEVENSHTEIN, VI .
INFORMATION AND CONTROL, 1975, 28 (04) :268-291
[6]   UPPER BOUNDS ON CARDINALITY OF A BINARY CODE WITH A GIVEN MINIMUM DISTANCE [J].
SIDELNIKOV, VM .
INFORMATION AND CONTROL, 1975, 28 (04) :292-303
[7]  
Szego G., 1939, ORTHOGONAL POLYNOMIA
[8]   LOW-RATE IMPROVEMENT ON ELIAS BOUND [J].
WELCH, LR ;
MCELIECE, RJ ;
RUMSEY, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (05) :676-678