Efficient decoding of the Gosset, Coxeter-Todd and the Barnes-Wall lattices
Moshe Ran, Jakov Snyders · 2002
Low complexity maximum-likelihood and bounded-distance soft decoding algorithms are presented for several block and lattice codes. The bounded-distance algorithms are based upon multilevel constructions of the codes. To demonstrate the approach, maximum-likelihood and bounded-distance decoders are devised for several well known codes and sphere packings in 8, 12 and 16 dimensions.