• DocumentCode
    2475665
  • Title

    Encoders to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)

  • Author

    Le Dantec, C. ; Piret, P.

  • Author_Institution
    CANON Res. Centre France, Cesson-Sevigne, France
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    291
  • Abstract
    Describes procedures to generate the words of a Reed-Solomon code over GF(q) having all their symbols in a subalphabet of GF(q). The goal is to match Reed-Solomon codes over GF(28) to the encoding of 64-QAM symbols
  • Keywords
    Galois fields; Reed-Solomon codes; modulation coding; quadrature amplitude modulation; 64-QAM symbols encoding; GF(28); GF(q); Reed-Solomon codes; subalphabet; Concurrent computing; Decoding; Encoding; Interpolation; Linear code; Parity check codes; Polynomials; Quadrature amplitude modulation; Reed-Solomon codes; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708896
  • Filename
    708896
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2475665