Loading...
conference paper
Computing roots of polynomials over function fields of curves
2000
Coding Theory and Cryptography
We design algorithms for finding roots of polynomials over function fields of curves. Such algorithms are useful for list decoding of Reed-Solomon and algebraic-geometric codes. In the first half of the paper we will focus on bivariate polynomials, i.e., polynomials over the coordinate ring of the affine line. In the second half we will design algorithms for computing roots of polynomials over the function field of a nonsingular absolutely irreducible plane algebraic curve. Several examples are included
Type
conference paper
Authors
Publication date
2000
Publisher
Published in
Coding Theory and Cryptography
Start page
214
End page
228
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Annapolis | October 25-26, 1998 | |
Available on Infoscience
January 26, 2007
Use this identifier to reference this record