• DocumentCode
    1037440
  • Title

    Idempotents and the BCH bound

  • Author

    Augot, Daniel ; Sendrier, Nicolas

  • Author_Institution
    Paris VI Univ., France
  • Volume
    40
  • Issue
    1
  • fYear
    1994
  • fDate
    1/1/1994 12:00:00 AM
  • Firstpage
    204
  • Lastpage
    207
  • 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
  • Keywords
    BCH codes; binary sequences; polynomials; BCH bound; binary BCH code; idempotents; minimum distance; narrow-sense primitive code; Galois fields; Polynomials;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.272483
  • Filename
    272483
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1037440