Excellent nonlinear codes from modular curves

Details Excellent nonlinear codes from modular curves Excellent nonlinear codes from modular curves

2001-04-10

arxiv.org/abs/math/0104115v1

Mathematics

Number Theory

Accepted for STOC-'01; 10 single-spaced twocolumn pages

Scientific paper

We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g -> infty over a field of size q0^2 yield nonlinear codes more efficient than the linear Goppa codes obtained from the same curves. These new codes now have the highest asymptotic transmission rates known for certain ranges of alphabet size and error rate. Both the theory and possible practical use of these new record codes require the development of new tools. On the theoretical side, establishing the transmission rate depends on an error estimate for a theorem of Schanuel applied to the function field of an asymptotically optimal curve. On the computational side, actual use of the codes will hinge on the solution of new problems in the computational algebraic geometry of curves.

Affiliated with

Also associated with

No associations

Rating

Excellent nonlinear codes from modular curves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Excellent nonlinear codes from modular curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Excellent nonlinear codes from modular curves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-534602