Cart (Loading....) | Create Account
Close category search window
 

Efficient Interpolation in the Wu List Decoding Algorithm

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
$31 $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)
Trifonov, P. ; Distributed Computing and Networking Department, Saint-Petersburg State Polytechnic University, Saint-Petersburg, Russia ; Moon Ho Lee

The interpolation step of the Wu list decoding algorithm for Reed–Solomon codes is considered. The problem is reformulated as construction of a partially homogenized interpolation polynomial. A generalization of the binary interpolation algorithm, which is based on the novel formulation of the interpolation step, is provided. It enables complexity reduction both with respect to the Wu method based on the iterative interpolation algorithm, as well as the Guruswami–Sudan method based on re-encoding and the binary interpolation algorithm.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 9 )

Date of Publication:

Sept. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.