An algorithm for list decoding number field codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

An algorithm for list decoding number field codes

Abstract

We present an algorithm for list decoding codewords of algebraic number field codes in polynomial time. This is the first explicit procedure for decoding number field codes whose construction were previously described by Lenstra and Guruswami. We rely on a new algorithm for computing the Hermite normal form of the basis of an $O_K$-module due to Biasse and Fieker where $O_K$ is the ring of integers of a number field K.

Dates and versions

hal-01113662 , version 1 (06-02-2015)

Identifiers

Cite

Guillaume Quintin, Jean-François Biasse. An algorithm for list decoding number field codes. 2012 IEEE International Symposium on Information Theory (ISIT 2012), Jul 2012, Cambridge, United States. pp.91-95, ⟨10.1109/ISIT.2012.6284696⟩. ⟨hal-01113662⟩
119 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More