• DocumentCode
    1721156
  • Title

    Simple MAP decoding of first order Reed-Muller and Hamming codes

  • Author

    Ashikhmin, Alexei ; Litsyn, S.

  • Author_Institution
    Lucent Technol. Bell Labs., Murray Hill, NJ, USA
  • fYear
    2003
  • Firstpage
    18
  • Lastpage
    21
  • Abstract
    We present new MAP decoding algorithms for first order Reed-Muller and Hamming codes. The proposed algorithms have complexities proportional to n×log2(n), where n is the code length.
  • Keywords
    Hamming codes; Reed-Muller codes; computational complexity; linear codes; maximum likelihood decoding; Hamming codes; MAP decoding; complexity; first order Reed-Muller codes; linear code; maximum likelihood decoding; Density functional theory; Error correction; Error correction codes; Finite impulse response filter; Linear code; Maximum likelihood decoding; Memoryless systems; Random variables; Sampling methods;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2003. Proceedings. 2003 IEEE
  • Print_ISBN
    0-7803-7799-0
  • Type

    conf

  • DOI
    10.1109/ITW.2003.1216684
  • Filename
    1216684
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1721156