Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

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 [12] and Guruswami [8]. We rely on a new algorithm for computing the Hermite normal form of the basis of an OK -module due to Biasse and Fieker [2] where OK is the ring of integers of a number field K.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00712441
Contributor : Guillaume Quintin Connect in order to contact the contributor
Submitted on : Wednesday, June 27, 2012 - 10:01:01 AM
Last modification on : Thursday, January 20, 2022 - 4:12:25 PM
Long-term archiving on: : Friday, September 28, 2012 - 2:25:09 AM

File

bare_conf.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00712441, version 1

Collections

Citation

Jean-François Biasse, Guillaume Quintin. An algorithm for list decoding number field codes. 2012. ⟨hal-00712441⟩

Share

Metrics

Record views

333

Files downloads

159