IEEE Transactions on Information Theory · 1994 · 69 citations · 3 references
ComputingComputer ScienceMathematicsAlgorithmsCryptographyTheory Of ComputationChannel CodingCoding TheoryError Control CodingError-correcting CodesBch CodesBounded Distance Decoding ProblemBounds On CodesCircuit Lower BoundsHamming CodesHamming DistanceMinimum DistanceMinimum Distance Bounds
Using a characterization of the idempotents of a narrow-sense primitive binary BCH code, the authors are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Their results are compiled in a table.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
3
J. J. Stiffler · 1971 · 1.4K citations
On the minimum distance of cyclic codes
JH van Lint, R. Wilson · IEEE Transactions on Information Theory · 1986 · 191 citations · Full text