• DocumentCode
    917559
  • Title

    Decoding beyond the BCH bound (Corresp.)

  • Author

    Hartmann, C.R.P.

  • Volume
    18
  • Issue
    3
  • fYear
    1972
  • fDate
    5/1/1972 12:00:00 AM
  • Firstpage
    441
  • Lastpage
    444
  • Abstract
    In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum distance decoding for any cyclic code. A comparison between this decoding algorithm and previously existing ones is also given.
  • Keywords
    BCH codes; Cyclic codes; Decoding; Error-correcting codes; Equations; Error correction; Error correction codes; Hamming distance; Information science; Iterative algorithms; Iterative decoding; Polynomials; Quadratic programming;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1972.1054824
  • Filename
    1054824
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=917559