Skip to main content

Modularity of Asymptotically Optimal Towers of Function Fields

  • Conference paper
Coding, Cryptography and Combinatorics

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 23))

  • 548 Accesses

Abstract

Elkies conjectures that all recursively defined asymptotically optimal towers of function fields over finite fields with square cardinality arise from elliptic modular curves, Shimura curves, or Drinfeld modular curves by appropriate reduction. In this paper we review the recursive asymptotically optimal towers constructed so far, discuss the reasons behind Elkies’ conjecture, present numerical evidence of this conjecture, and sketch Elkies’ proof of modularity of the new families.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V.G. Drinfel’d and S.G. Vladut Number of points of an algebraic curve. Funct. Anal. 17 (1983), 53–54.

    MathSciNet  MATH  Google Scholar 

  2. N.D. Elkies Explicit towers of Drinfeld modular curves. Proceedings of the 3rd European Congress of Mathematics, Barcelona, 7/2000.

    Google Scholar 

  3. N.D. Elkies Explicit modular towers Proceedings of the Thirty-Fifth Annual Aller-ton Conference on Communication, Control and Computing, T. Basar and A. Vardy, eds. (1997), 23–32.

    Google Scholar 

  4. N.D. Elkies, Appendix to New optimal tame towers of function fields over small finite fields by W.-C. W. Li, H. Maharaj, and H. Stichtenoth, Lecture Notes in Computer Science2369 C.Fieker and D.R.Kohel, eds. (2002), Springer-Verlag, Berlin, 384–389.

    Google Scholar 

  5. N.D. Elkies, http://abel.math.harvard.edu/elkies/compnt.html

  6. A. Garcia and H. Stichtenoth A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound Invent. Math.121 (1995), 211–222.

    Article  MathSciNet  MATH  Google Scholar 

  7. A. Garcia and H. Stichtenoth On the asymptotic behaviour of some towers of function fields over finite fields J. Number Theory 61 (1996), 248–273.

    Article  MathSciNet  MATH  Google Scholar 

  8. A. Garcia and H. Stichtenoth Asymptotically good towers of function fields over finite fields C.R. Acad. Sci. Paris Sér. I Math. 322 (1996), 1067–1070.

    MATH  Google Scholar 

  9. A. Garcia, H. Stichtenoth and M. Thomas On towers and composita of towers of function fields over finite fields. Finite Fields Appl. 3 (1997), no. 3, 257–274.

    Article  MathSciNet  MATH  Google Scholar 

  10. Y. Ihara Some remarks on the number of rational points of algebraic curves over finite fields J. Fac. Sci. Univ. Tokyo Sect. IA Math.28 (1981), 721–724.

    MathSciNet  MATH  Google Scholar 

  11. H.W. Lenstra, Jr. On a Problem of Garcia Stichtenoth and Thomas Finite Fields Appl.8 1–5 (2001).

    Google Scholar 

  12. W.-C.W. Li and H. Maharaj Coverings of curves with asymptotically many rational points J. Number Theory 96 (2002), 232–256.

    MathSciNet  MATH  Google Scholar 

  13. W.-C.W. Li, H. Maharaj, and H. Stichtenoth New optimal tame towers of function fields over small finite fields Lecture Notes in Computer Science 2369 C. Fieker and D.R. Kohel, eds. (2002), Springer-Verlag, Berlin, 372–389.

    Google Scholar 

  14. H. Maharaj, H. Stichtenoth, and J. Wulftange On a problem of Garcia Stichtenoth and Thomas II 2003, preprint.

    Google Scholar 

  15. H. Niederreiter and C.P. Xing Towers of global function fields with asymptotically many rational places and an improvement on the Gilbert-Varshamov bound. Math. Nachr.195 (1998), 171–186.

    Article  MathSciNet  MATH  Google Scholar 

  16. J.-P. Serre Rational Points on Curves over Finite Fields Lecture Notes, Harvard University, 1985.

    Google Scholar 

  17. P. Solé Towers of function fields and iterated means IEEE Trans. Inform. Theory46 (2000), 1532–1535.

    Article  MathSciNet  MATH  Google Scholar 

  18. A. Temkine Hilbert class field towers of function fields over finite fields and lower bounds for A(q) J. Number Theory 87 (2001), 189–210.

    Article  MathSciNet  MATH  Google Scholar 

  19. M.A. Tsfasman, S.G. Vladut and T. Zink Modular curves Shimura curves and Goppa codes better than the Varshamov-Gilbert bound Math. Nachr. 109 (1982), 21–28.

    Article  MathSciNet  MATH  Google Scholar 

  20. T. Zink Degeneration of Shimura surfaces and a problem in coding theory in Fundamentals of Computation Theory, L. Budach (ed.), Lecture Notes in Computer Science, Vol. 199 Springer, Berlin, p. 503–511, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Basel AG

About this paper

Cite this paper

Li, WC.W. (2004). Modularity of Asymptotically Optimal Towers of Function Fields. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-7865-4_3

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9602-3

  • Online ISBN: 978-3-0348-7865-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics