Title :
An algorithm for finding the roots of the polynomials over order domains
Author_Institution :
Acad. of Math. & Syst. Sci., Chinese Acad. of Sci., Beijing, China
Abstract :
In this work we propose a root-finding algorithm for the polynomials over order domains, which can be used for list decoding of codes from order domains.
Keywords :
Reed-Muller codes; algebraic geometric codes; decoding; polynomials; Reed-Muller codes; algebraic-geometric codes; list decoding; order domains; polynomials; root-finding algorithm; Algebra; Decoding; Equations; Galois fields; Mathematics; Noise measurement; Polynomials;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023474
