arXiv · 1107.2321
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 an equivalent of the LLL reduction algorithm for $\OK$-modules due to Fieker and Stehlé and on algorithms due to Cohen for computing the Hermite normal form of matrices representing modules over Dedekind domains.
Explore related subjects
Keep this discovery
Jean-François Biasse, Guillaume Quintin. 2012-04-05. An algorithm for list decoding number field codes. https://arxiv.org/abs/1107.2321
Cite the original work for its findings. Save a collection to share your selection of sources.