Journal ArticleDOI
A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
Xiaorong Wang,Hongbo Shi +1 more
Reads0
Chats0
TLDR
A key estimate is tightened, which dictates the computational complexity of Guruswami-Sudan algorithm, on the lower bound of the degrees of freedom, and a modified decoding algorithm is proposed for Reed-Solomon codes beyond half the minimum distance.About:
This article is published in Information Processing Letters.The article was published on 2010-10-01. It has received 0 citations till now. The article focuses on the topics: Berlekamp–Welch algorithm & BCJR algorithm.read more
References
More filters
Book
Algebraic Coding Theory
TL;DR: This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field.
Journal ArticleDOI
Shift-register synthesis and BCH decoding
TL;DR: It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits.
Journal ArticleDOI
Improved decoding of Reed-Solomon and algebraic-geometry codes
Venkatesan Guruswami,Madhu Sudan +1 more
TL;DR: An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes.
Journal ArticleDOI
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
TL;DR: To the best of the knowledge, this is the first efficient (i.e., polynomial time bounded) algorithm which provides error recovery capability beyond the error-correction bound of a code for any efficient code.
Journal ArticleDOI
Algebraic soft-decision decoding of Reed-Solomon codes
R. Koetter,Alexander Vardy +1 more
TL;DR: A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed and it is shown that the asymptotic performance can be approached as closely as desired with a list size that does not depend on the length of the code.
Related Papers (5)
Reliability-Based Forward Recursive Algorithms for Algebraic Soft-Decision Decoding of Reed--Solomon Codes
Haitao Xia,J.R. Cruz +1 more