• DocumentCode
    2891230
  • Title

    Bit-level erasure decoding of Reed-Solomon codes over GF(2m)

  • Author

    Moon, T.K. ; Budge, S.

  • Author_Institution
    Electr. & Comput. Eng. Dept., Utah State Univ., Logan, UT, USA
  • Volume
    2
  • fYear
    2003
  • fDate
    9-12 Nov. 2003
  • Firstpage
    1783
  • Abstract
    The algorithms for bit-level erasure decoding of (n,k) Reed-Solomon codes over GF(2m) beyond the design erasure decoding distance of n-k are considered. Erasure decoding takes place in the (mk, nk) binary image code. When the number of erasures exceeds n-k, then additional parity check equations must be developed. We describe how these equations are obtained and some of their properties. Decoding algorithms are discussed which tradeoff decoding performance for computational complexity. Simulation results for several families of codes are presented which provide information about good binary image codes.
  • Keywords
    Galois fields; Reed-Solomon codes; binary codes; decoding; image coding; parity check codes; GF(2m); Galois fields; Reed-Solomon code; binary image code; bit-level erasure decoding; computational complexity; parity check equation; Computational complexity; Computational modeling; Concatenated codes; Decoding; Equations; Interleaved codes; Moon; Parity check codes; Reed-Solomon codes; Streaming media;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2004. Conference Record of the Thirty-Seventh Asilomar Conference on
  • Print_ISBN
    0-7803-8104-1
  • Type

    conf

  • DOI
    10.1109/ACSSC.2003.1292290
  • Filename
    1292290
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2891230