Soft-decision decoding of Reed-Muller codes as generalized multipleconcatenated codes

摘要

Constructs Reed-Muller codes by generalized multiple concatenationof binary block codes of length 2. As a consequence of thisconstruction, a new decoding procedure is derived that usessoft-decision information. The algorithm is designed for low decodingcomplexity and is applicable to all Reed-Muller codes. It gives betterdecoding performance than soft-decision bounded-distance decoding. Itsdecoding complexity is much lower than that of maximum-likelihoodtrellis decoding of Reed-Muller codes, especially for long codes