On the decoding of Barnes-Wall lattices

2020/01/16 by Corlay, Vincent, Boutros, Joseph J., Ciblat, Philippe +1
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2001.05907

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.

Related

• Practical Encoders and Decoders for Euclidean Codes from Barnes-Wall Lattices
• List Decoding Barnes-Wall Lattices
• On the decoding of lattices constructed via a single parity check
• Lattice (List) Decoding Near Minkowski's Inequality
• Min-Sum algorithm for lattices constructed by Construction D