• DocumentCode
    984630
  • Title

    Algebraic decoding beyond eBCH of some binary cyclic codes, when e>eBCH

  • Author

    Bours, Patrick ; Janssen, Jeannette C M ; Van, Marcel Asperdt ; Van, Henk C A Tilborg

  • Author_Institution
    Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
  • Volume
    36
  • Issue
    1
  • fYear
    1990
  • fDate
    1/1/1990 12:00:00 AM
  • Firstpage
    214
  • Lastpage
    222
  • Abstract
    For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e´ with e BCH<e´⩽e can be decoded. The correctness of three of these algorithms is (partly) based on an exhaustive computer search; in all other cases, the algebraic proof is given in detail. It seems likely that many more cyclic codes can be decoded with these methods
  • Keywords
    decoding; error correction codes; algebraic algorithms; binary cyclic codes; decoding; error locator polynomial; Code standards; Computer science; Decoding; Error correction codes; Mathematics; Polynomials;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.50396
  • Filename
    50396
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=984630