By Topic

Decoding of Reed-Solomon codes for additive cost functions

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)
Koetter, R. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Vardy, A.

Efficient list decoding of Reed-Solomon codes beyond their error-correction radius has been studied in a number of recent papers. The approach is based on algebraic weighted-interpolation techniques. In this paper, we develop weight assignment schemes for arbitrary additive cost functions. Such functions are defined on the product space Fq×𝒴 They include the Hamming metric and the generalized Hamming metric, as well as log-likelihood based costs, as special cases.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002