DocumentCode
3278853
Title
The error locator polynomial for correctable (t + 1)-error of RS codes
Author
Mohri, Masami ; Morii, Masakatu
Author_Institution
Inf. & Multimedia Center, Gifu Univ., Gifu
fYear
2008
fDate
7-10 Dec. 2008
Firstpage
1
Lastpage
6
Abstract
The t-error-correcting Reed-Solomon (RS) code can detect more than t errors with high probability. Welch-Berlekamp (WB) algorithm is known as a decoding algorithm for RS codes, and it can solved the remainder key-equation. We have shown the condition for detecting the (t +mu )-error of RS code by WB algorithm. In this paper, we show a error locator polynomial for correctable (t + 1)-error of RS codes.
Keywords
Reed-Solomon codes; decoding; error correction codes; polynomials; probability; RS code; Welch-Berlekamp algorithm; error locator polynomial; probability; remainder key-equation decoding; t-error-correcting Reed-Solomon code; Decoding; Electronic mail; Equations; Error correction codes; Information theory; Polynomials; Reed-Solomon codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location
Auckland
Print_ISBN
978-1-4244-2068-1
Electronic_ISBN
978-1-4244-2069-8
Type
conf
DOI
10.1109/ISITA.2008.4895443
Filename
4895443
Link To Document