DocumentCode
3063390
Title
Decoding of one-point codes using error evaluator polynomials
Author
O´Sullivan, M.E.
Author_Institution
Dept. of Math., Puerto Rico Univ., Mayaguez
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
377
Abstract
The author amends the decoding algorithm developed previously which generalizes the Berlekamp-Massey algorithm to a broad class of algebraic geometry codes called one-point codes. The Berlekamp-Massey algorithm and its generalization both produce a set of error locator polynomials which are then used to find the positions where the errors occurred. In the case of Reed-Solomon codes, the algorithm may be modified to also calculate an error evaluator polynomial
Keywords
Reed-Solomon codes; algebraic geometric codes; decoding; polynomials; Berlekamp-Massey algorithm; Reed Solomon code; algebraic geometry codes; decoding; error evaluator polynomials; error locator polynomials; one-point codes; Application software; Computer errors; Decoding; Equations; Fourier transforms; Geometry; Hardware; Mathematics; Polynomials; Reed-Solomon codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613314
Filename
613314
Link To Document