Idempotents and the BCH bound
Daniel Augot, Nicolas Sendrier · IEEE Transactions on Information Theory · 1994
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.>