• DocumentCode
    846607
  • Title

    Decoding binary two-error correcting cyclic codes with Zech logarithms

  • Author

    Stevens, Patrick ; Ward, Harold N.

  • Author_Institution
    Generale Bank, Brussels, Belgium
  • Volume
    40
  • Issue
    12
  • fYear
    1992
  • fDate
    12/1/1992 12:00:00 AM
  • Firstpage
    1789
  • Lastpage
    1792
  • Abstract
    A decoding method for binary two-error correcting cyclic codes whose generator polynomials have at most two irreducible factors is presented. This class includes binary narrow-sense BCH codes with designed distance 5. The decoding algorithm uses the Zech logarithm for the finite field in which the roots of the code lie
  • Keywords
    BCH codes; cyclic codes; decoding; error correction codes; Zech logarithms; binary two-error correcting cyclic codes; decoding; finite field; generator polynomials; irreducible factors; narrow-sense BCH codes; Algebra; Codes; Communications Society; Decoding; Galois fields; Jacobian matrices; Mathematics; Polynomials; Rail to rail inputs;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.192400
  • Filename
    192400
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=846607