Skip to main content
SpringerLink
Log in
Book cover

International Conference on Finite Fields and Applications

Fq 2003: Finite Fields and Applications pp 154–165Cite as

On the Construction of Some Towers over Finite Fields

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2948))

Abstract

The explicit construction of towers with many rational places plays a key role for the construction of asymptotically good algebraic geometric codes. One way of explicitly constructing towers is given by defining them recursively via a single equation. In this paper we discuss conditions on the defining equation to give towers with many rational places and introduce a new family of such towers.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Garcia, A., Stichtenoth, H.: On Tame Towers over finite fields. J. Reine Angew. Math. 557, 53–80 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lenstra, H.W.: On a problem of Garcia, Stichtenoth, and Thomas. Finite Fields Appl. 8, 166–170 (2001)

    Article  MathSciNet  Google Scholar 

  5. Özbudak, F., Thomas, M.: A Note on Towers of Function Fields Over Finite Fields. Communications in Algebra 26, 11 (1998)

    Article  Google Scholar 

  6. Stichtenoth, H.: Algebraic Function Fields and Codes. Springer, Heidelberg (1993)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Wulftange, J.: Zahme Türme algebraischer Funktionenkörper. Dissertation, Essen (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Essen, Germany

    Jörg Wulftange

Authors
  1. Jörg Wulftange
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, The Pennsylvania State University, University Park, 16802, PA, USA

    Gary L. Mullen

  2. University Paul Sabatier, AAECC/IRIT, 118 route de Narbonne, 31300, Toulouse cedex, France

    Alain Poli

  3. Sabancı University - FENS, Orhanli - Tuzla, 34956, Istanbul, Turkey

    Henning Stichtenoth

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wulftange, J. (2004). On the Construction of Some Towers over Finite Fields. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds) Finite Fields and Applications. Fq 2003. Lecture Notes in Computer Science, vol 2948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24633-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24633-6_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21324-6

  • Online ISBN: 978-3-540-24633-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation