Generalised minimum distance decoding of Reed-Muller codes and Barnes-Wall lattices
Chunxiang Wang, Ba-Zhong Shen, Kenneth K. Tzeng · 2002
Low complexity soft decision decoding algorithms for Reed-Muller codes and Barnes-Wall lattices are presented. These algorithms are constructed based on the usage of generalised minimum distance (GMD) decoding recursively. Evaluation of the algorithms on AWGN channel through computer simulation indicates a slight degradation in performance, compared to maximum likelihood decoding, but with considerable reduction in complexity.