Work

On the decoding of Barnes-Wall lattices

Year: 2020

Type: conference-paper

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

Source: IEEE International Symposium on Information Theory (ISIT)

DOI: 10.1109/isit44484.2020.9173976

Authors: Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel

Institutions: Télécom Paris, Institut Polytechnique de Paris, Texas A&M University System, Texas A&M University at Qatar, Laboratoire Traitement et Communication de l’Information, Mitsubishi Electric (France)

Language: English

Topic: Coding theory and cryptography

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3000489341

FWCI: 0.388

Cites: 31

Cited by: 4

Related to: 10