Idempotents and the BCH bound - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 1994

Idempotents and the BCH bound

Daniel Augot
  • Function : Author
  • PersonId : 833459
Nicolas Sendrier

Abstract

Using 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.
Fichier principal
Vignette du fichier
idem.pdf (885.02 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00723735 , version 1 (13-08-2012)

Identifiers

Cite

Daniel Augot, Nicolas Sendrier. Idempotents and the BCH bound. IEEE Transactions on Information Theory, 1994, 40 (1), pp.204-207. ⟨10.1109/18.272483⟩. ⟨hal-00723735⟩

Collections

INRIA INSMI INRIA2
101 View
223 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More