DocumentCode
648516
Title
A list decoding algorithm for practical reed-solomon codes
Author
Egorov, Sergey
Author_Institution
Dept. of Comput. Eng., South West State Univ., Kursk, Russia
fYear
2013
fDate
27-30 Sept. 2013
Firstpage
1
Lastpage
4
Abstract
A novel algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. This algorithm is based on analytical continuation of the Berlekamp-Massey algorithm through additional iterations. It is shown that the proposed algorithm allows to correct more errors compared to Guruswami-Sudan (GS) algorithm. Also computational complexity of the new algorithm is less than GS algorithm one if number of extra correcting errors (τ) is small. Further complexity reduction is achieved by use of soft decisions. The coding gain of the proposed algorithm is shown for some practical codes.
Keywords
Reed-Solomon codes; computational complexity; decoding; error correction codes; Berlekamp-Massey algorithm; GS algorithm; Guruswami-Sudan algorithm; Reed-Solomon codes; analytical continuation; complexity reduction; computational complexity; error correcting errors; list decoding algorithm; soft decisions;
fLanguage
English
Publisher
ieee
Conference_Titel
Design & Test Symposium, 2013 East-West
Conference_Location
Rostov-on-Don
Print_ISBN
978-1-4799-2095-2
Type
conf
DOI
10.1109/EWDTS.2013.6673101
Filename
6673101
Link To Document