Answers are grounded in this paper and cite their sources.
It is shown that if <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m ≠ 8, 12</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m > 6</tex> , there are some binary primitive BCH codes (BCH codes in a narrow sense) of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2ᵐ - 1</tex> 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 <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m ≥ 6</tex> , there are some binary cyclic codes of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2ᵐ - 1</tex> that have more information digits than the primitive BCH codes of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2ᵐ - 1</tex> with the same minimum weight.
No takes yet. Share an insight, caveat, or question.
Kasami et al. (1969) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: