• DocumentCode
    3449717
  • Title

    A new algorithm for correcting single burst errors with Reed-Solomon codes

  • Author

    Chi, Danny T.

  • fYear
    1991
  • fDate
    4-7 Nov 1991
  • Firstpage
    1254
  • Abstract
    The author presents a fast algorithm which can correct a single burst error length up to n-k-1 for a RS (n, k) code. Several methods which can reduce the probability of misdecoding if the length of the burst is longer than [(n-k )/2] are discussed. An RS (Reed-Solomon) decoder design is proposed which performs a regular error correction and the proposed burst error correction simultaneously. This method can also be used for BCH codes and for RS codes over Galois fields of characteristics other than two
  • Keywords
    Decoding; Error correction; Error correction codes; Galois fields; Hardware; Polynomials; Redundancy; Reed-Solomon codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Military Communications Conference, 1991. MILCOM '91, Conference Record, Military Communications in a Changing World., IEEE
  • Conference_Location
    McLean, VA
  • Print_ISBN
    0-87942-691-8
  • Type

    conf

  • DOI
    10.1109/MILCOM.1991.258469
  • Filename
    258469
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3449717