By Topic

Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon 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
$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)
Duggan, A. ; Dept. of Electr., Univ. of Maryland, College Park, MD ; Barg, A.

We investigate the decoding region for algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error correction radius within which the soft-decision decoder produces a list that contains the transmitted codeword. The error radius for ASD is shown to be larger than that of Guruswami-Sudan (GS) hard-decision decoding for a subset of low and medium-rate codes. These results are also extended to multivariable interpolation in the sense of Parvaresh and Vardy.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 11 )