Some results on the minimum weight of primitive BCH codes (Corresp.)
Tadao Kasami, Shu Hwa Lin · IEEE Transactions on Information Theory · 1972
For1 \leq i \leq m - s- 2and0 \leq s \leq m -2i, the intersection of the binary BCH code of designed distance2 ^{m-s-1} - 2 ^{m-s-t-1} - 1and length2^m - 1with the shortened(s + 2)th-order Reed-Muller code of length2^m -- 1has codewords of weight2^{m-s-1} - 2^{m-s-t-1} - 1.