Idempotents and the BCH bound

Daniel Augot, Nicolas Sendrier

IEEE Transactions on Information Theory · 1994 · 69 citations · 3 references

DOIFull text

Open access

Concepts

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

References

3