On the decoding of Barnes-Wall lattices

01/16/2020
by   Vincent Corlay, et al.
0

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. The error rate is shown to be close to the universal lower bound in dimensions 64 and 128.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset