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

Efficient decoding of Reed-Solomon codes beyond half the minimum distance

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)
Roth, R.M. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; Ruckenstein, G.

A list decoding algorithm is presented for [n,k] Reed-Solomon (RS) codes over GF(q), which is capable of correcting more than [(n-k)/2] errors. Based on a previous work of Sudan (see J. Compl., vol.13, p.180-93, 1997), an extended key equation (EKE) is derived for RS codes, which reduces to the classical key equation when the number of errors is limited to [(n-k)/2]. Generalizing Massey's (1969) algorithm that finds the shortest recurrence that generates a given sequence, an algorithm is obtained for solving the EKE in time complexity O(l·(n-k)2 ), where l is a design parameter, typically a small constant, which s an upper bound on the size of the list of decoded codewords. (The case l=1 corresponds to classical decoding of up to [(n-k)/2] errors where the decoding ends with at most one codeword.) This improves on the time complexity O(n3) needed for solving the equations of Sudan's algorithm by a naive Gaussian elimination. The polynomials found by solving the EKE are then used for reconstructing the codewords in time complexity O((llog2l)k(n+llogq)) using root-finders of degree-l univariate polynomials

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 1 )

Date of Publication:

Jan 2000

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.