DocumentCode
2935235
Title
Fast error magnitude evaluations for Reed-Solomon codes
Author
Komo, John J. ; Joiner, Laurie L.
Author_Institution
Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA
fYear
1995
fDate
17-22 Sep 1995
Firstpage
416
Abstract
A fast algorithm for the evaluation of error magnitudes for Reed-Solomon codes is obtained here in terms of the error locations and syndromes. This fast algorithm is compared to the Forney algorithm (1965) in terms of required additions and multiplications and implementation speed
Keywords
Reed-Solomon codes; decoding; error correction codes; Forney algorithm; Reed-Solomon codes; decoding; error correcting code; error locations; error magnitude evaluation; fast algorithm; syndromes; Computer errors; Digital communication; Error correction; Error correction codes; Iterative algorithms; Iterative decoding; Matrices; Reed-Solomon codes; Research initiatives;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.550403
Filename
550403
Link To Document