Title :
Idempotents and the BCH bound
Author :
Augot, Daniel ; Sendrier, Nicolas
Author_Institution :
Paris VI Univ., France
fDate :
1/1/1994 12:00:00 AM
Abstract :
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
Keywords :
BCH codes; binary sequences; polynomials; BCH bound; binary BCH code; idempotents; minimum distance; narrow-sense primitive code; Galois fields; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
