IEEE Transactions on Information Theory · 1969 · 65 citations · 3 references
ComputingComputer ScienceMathematicsAlgorithmsInformation TheoryTheory Of ComputationCoding TheoryComputational ComplexityError-correcting CodesBch CodesBinary CodesBounds On CodesCode BoundsHamming Distance
It is shown that if <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m \neq 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^{m} - 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 \geq 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^{m} - 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^{m} - 1</tex> with the same minimum weight.
3