On the decoding of Barnes-Wall lattices

01/16/2020

∙

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

On the decoding of Barnes-Wall lattices

A new framework for building and decoding group codes

Design of Polar Code Lattices of Small Dimension

The Voronoi Region of the Barnes-Wall Lattice Λ_16

Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction

SiWa: See into Walls via Deep UWB Radar

On a recursive construction of circular paths and the search for π on the integer lattice Z^2

Singularity and Mesh Divergence of Inviscid Adjoint Solutions at Solid Walls

On the decoding of Barnes-Wall lattices

Related Research

A new framework for building and decoding group codes

Design of Polar Code Lattices of Small Dimension

The Voronoi Region of the Barnes-Wall Lattice Λ_16

Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction

SiWa: See into Walls via Deep UWB Radar

On a recursive construction of circular paths and the search for π on the integer lattice Z^2

Singularity and Mesh Divergence of Inviscid Adjoint Solutions at Solid Walls