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.
Type de document :
Communication dans un congrès
Muriel Médard; Lizhong Zheng. 2012 IEEE International Symposium on Information Theory (ISIT 2012), Jul 2012, Cambridge, United States. IEEE, pp.91-95, 2012, Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. 〈http://isit12.org/〉. 〈10.1109/ISIT.2012.6284696〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01113662
Contributeur : Daniel Augot <>
Soumis le : vendredi 6 février 2015 - 09:48:49
Dernière modification le : jeudi 10 mai 2018 - 02:06:34

Lien texte intégral

Identifiants

Collections

Citation

Guillaume Quintin, Jean-François Biasse. An algorithm for list decoding number field codes. Muriel Médard; Lizhong Zheng. 2012 IEEE International Symposium on Information Theory (ISIT 2012), Jul 2012, Cambridge, United States. IEEE, pp.91-95, 2012, Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. 〈http://isit12.org/〉. 〈10.1109/ISIT.2012.6284696〉. 〈hal-01113662〉

Partager

Métriques

Consultations de la notice

155