2000 character limit reached
On the decoding of Barnes-Wall lattices (2001.05907v3)
Published 16 Jan 2020 in cs.IT and math.IT
Abstract: 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.