By Topic

An algorithm for list decoding number field codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jean-Fran├žois Biasse ; Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, Alberta, Canada T2N 1N4 ; Guillaume Quintin

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

Published in:

Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on

Date of Conference:

1-6 July 2012