We determine the generalized Hamming weights dr for1⩽r⩽h+2 of a binary primitive BCH code with minimum distance d=2h-1. This extends a result of van der Geer and van der Vlugt(see IEEE Trans. on Inform. Theory, vol.40, p. 543-46, 1994 and vol. 41,p.300-1, 1995) who determined dr, for 1⩽r⩽5 for thetriple error correcting primitive BCH code. We also consider the weighthierarchy of some codes with a parity-check polynomial which are theproduct of two primitive polynomials of the same degree. In particularwe have studied some of the codes with few nonzero weights studied byNiho (see Ph.d thesis, University of Southern California, USCEE report409, Los Angeles, USA)
展开▼
机译：我们确定以下项的广义汉明权重d r
最小距离d = 2的二进制原始BCH码的1和r + h + 2
h -1。这扩展了范德格（van der Geer）和范德Vlugt（van der Vlugt）的结果
（请参阅IEEE Trans。on Inform。Theory，第40卷，第543-46页，1994年和第41卷，
（p.300-1，1995），谁确定d r ，则1＆les; r＆les; 5
三重纠错原始BCH码。我们也考虑重量
带有奇偶校验多项式的某些代码的层次结构
相同度数的两个原始多项式的乘积。特别是
我们已经研究了一些由非零权重研究的代码
Niho（请参阅南加州大学博士学位论文，USCEE报告
409，美国洛杉矶）
展开▼
