SOME REMARKS ON BCH BOUNDS AND MINIMUM WEIGHTS OF BINARY PRIMITIVE BCH CODES

被引：25

作者：

KASAMI, T

TOKURA, N

机构：

[1] Faculty of Engineering Science, Osaka University, Osaka

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1969年 / 15卷 / 03期

关键词：

D O I：

10.1109/TIT.1969.1054304

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

It is shown that if m ≠ 8, 12 and m > 6, there are some binary primitive BCH codes (BCH codes in a narrow sense) of length 2m-1 whose minimum weight is greater than the BCH bound. This gives a negative answer to the question posed by Peterson [1] of whether or not the BCH bound is always the actual minimum weight of a binary primitive BCH code. It is also shown that for any even m > 6, there are some binary cyclic codes of length 2m-1 that have more information digits than the primitive BCH codes of length 2m - 1 with the same minimum weight. © 1969 IEEE. All rights reserved.

引用

页码：408 / +