On the decoding of Barnes-Wall lattices
Information Theory
2020-06-15 v3 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.
Keywords
Cite
@article{arxiv.2001.05907,
title = {On the decoding of Barnes-Wall lattices},
author = {Vincent Corlay and Joseph J. Boutros and Philippe Ciblat and Loïc Brunel},
journal= {arXiv preprint arXiv:2001.05907},
year = {2020}
}
Comments
Presented at ISIT 2020