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.>
No takes yet. Share an insight, caveat, or question.
Augot et al. (1994) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: