• DocumentCode
    2478959
  • Title

    Improved list-decoding for Reed-Muller codes as generalized multiple concatenated (GMC) codes

  • Author

    Lucas, R. ; Bossert, M. ; Dammann, A.

  • Author_Institution
    Hawaii Univ., Honolulu, HI, USA
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    337
  • Abstract
    We present a new list-decoding algorithm for Reed-Muller (RM) codes based on the GMC decoding algorithm proposed previously. As a result, a SDML decoding algorithm for the 1st order RM codes is obtained. Furthermore, simulations showed that for RM codes of higher order and up to a length 1024, the performance of L-GMC decoding is more than 1 dB superior to conventional GMC decoding
  • Keywords
    Reed-Muller codes; computational complexity; concatenated codes; decoding; 1st order RM codes; Reed-Muller codes; SDML decoding algorithm; generalized multiple concatenated codes; list-decoding algorithm; performance; simulations; Computational complexity; Computational modeling; Concatenated codes; Decoding; Degradation;
  • 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.708942
  • Filename
    708942