Efficient Maximum-Likelihood Decoding of Reed-Muller RM(m-3,m) Codes

Conference Paper

Reed-Muller (RM) codes, a classical family of codes known for their elegant algebraic structure, have recently been shown to achieve capacity under maximum-likelihood (ML) decoding on the binary erasure channel and this has rekindled interest in their efficient decoding. We consider the code family RM(m-3,m) and develop a new ML decoder, for transmission over the binary symmetric channel, that exploits their large symmetry group. The new decoder has lower complexity than an earlier method introduced by Seroussi and Lempel in 1983.

Full Text

Duke Authors

Cited Authors

  • Thangaraj, A; Pfister, HD

Published Date

  • June 1, 2020

Published In

Volume / Issue

  • 2020-June /

Start / End Page

  • 263 - 268

International Standard Serial Number (ISSN)

  • 2157-8095

International Standard Book Number 13 (ISBN-13)

  • 9781728164328

Digital Object Identifier (DOI)

  • 10.1109/ISIT44484.2020.9174065

Citation Source

  • Scopus