A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes

Authors:
Xiaorong Wang;Hongbo Shi
Affiliations:
Department of Applied Mathematics, Nanjing University of Finance and Economics, Nanjing 210046, China;Department of Applied Mathematics, Nanjing University of Finance and Economics, Nanjing 210046, China
Venue:
Information Processing Letters
Year:
2010

Citing 9
Cited 0

Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes

IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
Efficient decoding of Reed-Solomon codes beyond half the minimum distance

IEEE Transactions on Information Theory
Error-correcting codes for list decoding

IEEE Transactions on Information Theory
Shift-register synthesis and BCH decoding

IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes

IEEE Transactions on Information Theory
New List Decoding Algorithms for Reed–Solomon and BCH Codes

IEEE Transactions on Information Theory
Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

We tighten a key estimate, which dictates the computational complexity of Guruswami-Sudan algorithm, on the lower bound of the degrees of freedom, and then propose a modified decoding algorithm for Reed-Solomon codes beyond half the minimum distance. The computational complexity of the modified algorithm is lower than the Guruswami-Sudan algorithm for the medium to high rate Reed-Solomon codes, and has the same asymptotic complexity as the algorithm proposed by Wu. Besides we also claim that our modified algorithm outperforms Wu's algorithm to some extent.