Skip to main content

Codes on Algebraic Curves

  • Book
  • © 1999

Overview

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

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Error-Correcting Codes

  2. Algebraic Curves and Varieties

  3. Elliptic and Modular Curves

  4. Geometric Goppa Codes

Keywords

About this book

This is a self-contained introduction to algebraic curves over finite fields and geometric Goppa codes. There are four main divisions in the book. The first is a brief exposition of basic concepts and facts of the theory of error-correcting codes (Part I). The second is a complete presentation of the theory of algebraic curves, especially the curves defined over finite fields (Part II). The third is a detailed description of the theory of classical modular curves and their reduction modulo a prime number (Part III). The fourth (and basic) is the construction of geometric Goppa codes and the production of asymptotically good linear codes coming from algebraic curves over finite fields (Part IV). The theory of geometric Goppa codes is a fascinating topic where two extremes meet: the highly abstract and deep theory of algebraic (specifically modular) curves over finite fields and the very concrete problems in the engineering of information transmission. At the present time there are two essentially different ways to produce asymptotically good codes coming from algebraic curves over a finite field with an extremely large number of rational points. The first way, developed by M. A. Tsfasman, S. G. Vladut and Th. Zink [210], is rather difficult and assumes a serious acquaintance with the theory of modular curves and their reduction modulo a prime number. The second way, proposed recently by A.

Authors and Affiliations

  • Bilkent University, Ankara, Turkey

    Serguei A. Stepanov

  • Steklov Mathematical Institute, Moscow, Russia

    Serguei A. Stepanov

Bibliographic Information

  • Book Title: Codes on Algebraic Curves

  • Authors: Serguei A. Stepanov

  • DOI: https://doi.org/10.1007/978-1-4615-4785-3

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Kluwer Academic/Plenum Publishers 1999

  • Hardcover ISBN: 978-0-306-46144-6Published: 31 July 1999

  • Softcover ISBN: 978-1-4613-7167-0Published: 21 October 2012

  • eBook ISBN: 978-1-4615-4785-3Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: XIII, 350

  • Topics: Algebra, Electrical Engineering, Algebraic Geometry, Algorithms

Publish with us