  We present new efficient recursive decoders for the Barnes-Wall lattices
based on their squaring construction. The analysis of the new decoders reveals
a quasi-quadratic complexity in the lattice dimension and a quasi-linear
complexity in the list-size. The error rate is shown to be close to the
universal lower bound in dimensions 64 and 128.
