• DocumentCode
    2940419
  • Title

    List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity

  • Author

    Dumer, Ilya ; Kabatiansky, Grigory ; Tavernier, Cédric

  • Author_Institution
    California Univ., Riverside, CA
  • fYear
    2006
  • fDate
    9-14 July 2006
  • Firstpage
    138
  • Lastpage
    142
  • Abstract
    A new deterministic list decoding algorithm is proposed for general Reed-Muller codes RM(s,m) of length n = 2m and distance d = 2m-epsi. Given n and d, the algorithm performs beyond the bounded distance threshold of d/2 and has a low complexity order of nmepsi-1 for any decoding radius T that is less than the Johnson bound
  • Keywords
    Reed-Muller codes; computational complexity; decoding; Johnson bound; Reed-Muller codes; decoding; linear complexity; Binary decision diagrams; Decoding; Electronic mail; Error correction; Error correction codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2006 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    1-4244-0505-X
  • Electronic_ISBN
    1-4244-0504-1
  • Type

    conf

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