UPPER BOUNDS FOR UNRESTRICTED BINARY ERROR-CORRECTING CODES

被引：20
作者：
JOHNSON, SM
机构：
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1971年 / 17卷 / 04期
关键词：
D O I：
10.1109/TIT.1971.1054656
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：466 / +
相关论文
共 12 条
[1]  
ASH R, 1965, INFORMATION THEORY, P127
[2]   ERROR DETECTING AND ERROR CORRECTING CODES [J].
HAMMING, RW .
BELL SYSTEM TECHNICAL JOURNAL, 1950, 29 (02) :147-160
[3]   IMPROVED ASYMPTOTIC BOUNDS FOR ERROR-CORRECTING CODES [J].
JOHNSON, SM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1963, 9 (03) :198-&
[4]   A NEW UPPER BOUND FOR ERROR-CORRECTING CODES [J].
JOHNSON, SM .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (03) :203-207
[5]  
JOHNSON SM, TO BE PUBLISHED
[6]  
MCELIECE RJ, 1969, B AM MATH SOC, P32
[7]   AN OPTIMUM NONLINEAR CODE [J].
NORDSTROM, AW ;
ROBINSON, JP .
INFORMATION AND CONTROL, 1967, 11 (5-6) :613-+
[8]   BINARY-CODES WITH SPECIFIED MINIMUM DISTANCE [J].
PLOTKIN, M .
IRE TRANSACTIONS ON INFORMATION THEORY, 1960, 6 (04) :445-450
[9]   A CLASS OF OPTIMUM NONLINEAR DOUBLE-ERROR-CORRECTING CODES [J].
PREPARATA, FP .
INFORMATION AND CONTROL, 1968, 13 (04) :378-+
[10]  
SHANNON CE, 1967, INFORM CONTR, V10, P448
12