List-Decoding Barnes-Wall Lattices

Computational Complexity, Volume 26, Issue 2, 2017, Pages 365-392.

Cited by: 1|Bibtex|Views14|Links
EI
Keywords:
Barnes–Wall lattices Johnson bound list decoding Reed–Muller codes 68Q25

Abstract:

The question of list-decoding error-correcting codes over finite fields (under the Hamming metric) has been widely studied in recent years. Motivated by the similar discrete linear structure of linear codes and point lattices in ${\\mathbb{R}^{N}}$RN, and their many shared applications across complexity theory, cryptography, and coding ...More

Code:

Data:

Your rating :
0

 

Tags
Comments