LONG PRIMITIVE BINARY BCH CODES HAVE DISTANCE D - 2N IN R-1/LOG N

被引:10
作者
BERLEKAMP, ER
机构
关键词
D O I
10.1109/TIT.1972.1054818
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:415 / +
页数:1
相关论文
共 8 条
[1]  
Berlekamp E. R., 1970, Information and Control, V17, P485, DOI 10.1016/S0019-9958(70)90399-2
[2]  
Berlekamp E. R., 1968, ALGEBRAIC CODING THE
[3]  
Feller W., 1957, INTRO PROBABILITY TH
[4]   SOME REMARKS ON BCH BOUNDS AND MINIMUM WEIGHTS OF BINARY PRIMITIVE BCH CODES [J].
KASAMI, T ;
TOKURA, N .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (03) :408-+
[5]   NUMBER OF INFORMATION SYMBOLS IN BOSE-CHAUDHURI CODES [J].
MANN, HB .
INFORMATION AND CONTROL, 1962, 5 (02) :153-&
[6]  
MANN HB, MATH REV, V26, P4847
[7]  
MCELIECE RJ, 1967, THESIS CALIFORNIA I
[8]  
Robins H., 1955, AM MATH MON, V6, P26, DOI 10.2307/2308012