Idempotents and the BCH bound

Authors:
  • DAD. Augot
    D. Augot
  • NSN. Sendrier
    N. Sendrier

Abstract
International audienceUsing a characterization of the idempotents of a narrow- sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Our results are compiled in a table

This publication has 2 references indexed in Scilit: