IEEE Transactions on Information Theory · 1986 · 191 citations · 7 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationCoding TheoryComputational ComplexityError-correcting CodesBch CodesBinary CodesBounds On CodesCode BoundsCyclic CodesHamming DistanceMinimum DistanceMinimum Distance Bounds
The main result is a new lower bound for the minimum distance of cyclic codes that includes earlier bounds (i.e., BCH bound, HT bound, Roos bound). This bound is related to a second method for bounding the minimum distance of a cyclic code, which we call shifting. This method can be even stronger than the first one. For all binary cyclic codes of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">< 63</tex> (with two exceptions), we show that our methods yield the true minimum distance. The two exceptions at the end of our list are a code and its even-weight subcode. We treat several examples of cyclic codes of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\geq 63</tex> .
7
J. J. Stiffler · 1971 · 1.4K citations
Generalizations of the BCH bound
C. Hartmann, K.K. Tzeng · Information and Control · 1972 · 153 citations
Weight congruences for p-ary cyclic codes
Robert J. McEliece · Discrete Mathematics · 1972 · 78 citations