Excellent codes from modular curves

Authors:
Noam D. Elkies
Affiliations:
Department of Mathematics, Harvard University, Cambridge, MA
Venue:
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Year:
2001

Citing 5
Cited 3

Algebraic-Geometric Codes

Algebraic-Geometric Codes
Shimura Curve Computations

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
List decoding of algebraic-geometric codes

IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
On Towers and Composita of Towers of Function Fields over Finite Fields

Finite Fields and Their Applications

Improvements on parameters of algebraic-geometry codes from Hermitian curves

IEEE Transactions on Information Theory
Nonlinear codes from points of bounded height

Finite Fields and Their Applications
Further improvements on asymptotic bounds for codes using distinguished divisors

Finite Fields and Their Applications

Quantified Score

Hi-index	0.06

Visualization

Abstract

We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g\ra\infty over a field of size q_0^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.