scientific article; zbMATH DE number 1512349

Publication date 3 October 2000

algebraic curve asymptotically good sequence geometric Goppa code modular curve zeta function

Arithmetic algebraic geometry (Diophantine geometry) (11Gxx) Applications to coding theory and cryptography of arithmetic geometry (14G50) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

This book is a very good resource for the theory of algebraic geometry codes. It includes more extensive treatments of the topics in the lectures of \textit{J. H. van Lint} and \textit{G. van der Geer} [Introduction to coding theory and algebraic geometry. DMV Seminar 12, Basel, Birkhäuser (1988; Zbl 0639.00048)], and it also includes the arithmetic theory found in the text by \textit{C. Moreno} [Algebraic curves over finite fields, Cambridge Tracts in Mathematics, 97. Cambridge, Cambridge University Press (1991; Zbl 0733.14025)]. The book is divided into four parts. The first part contains basic definitions, bounds, and constructions of coding theory. The projective systems of Tsfasman and Vladut are treated in some exercises. The second part is an introduction to algebraic curves, with special attention to curves over finite fields. Several proofs for foundational results in algebraic geometry are omitted here, with references given to standard sources. The Riemann-Roch Theorem is proved using repartitions to get the needed duality statements. The definition of Weierstrass point (p. 97) is only appropriate for classical curves. The Riemann hypothesis for curves over finite fields is proved using the argument developed by the author and \textit{E. Bombieri} [Sém. Bourbaki 1972/73, Exp. No. 430, Lect. Notes Math. 383, 234-241 (1974; Zbl 0307.14011)]. The author additionally proves Serre's improvement of the Hasse-Weil bound. The theory of function fields is also used in this part, with references given to the texts by \textit{M. Deuring} [Lectures on the theory of algebraic functions of one variable, Lect. Notes Math. 314 (1973; Zbl 0249.14008)] and \textit{H. Stichtenoth} [Algebraic function fields and codes. Universitext. Berlin, Springer (1993; Zbl 0816.14011)]. The third part deals with elliptic and modular curves. The author describes classical modular curves and the Galois theory of elliptic function fields. This part culminates in a statement of the Eichler-Selberg trace formula, which is used, as in C. Moreno's book, to give a proof of the Tsfasman-Vladut-Zink theorem. The final part is devoted to geometric Goppa (or algebraic geometry) codes. The author considers standard examples and then discusses asymptotically good geometric codes. Here, the author not only considers codes from modular curves, as done by Tsfasman-Vladut-Zink, but also the more recent work by \textit{A. Garcia} and \textit{H. Stichtenoth} [Invent. Math. 121, 211-222 (1995; Zbl 0822.11078)] that uses towers of Artin-Schreier extensions to produce asymptotically good sequences of codes. In addition, the author includes his work [Discrete Math. Appl. 7, No. 1, 77-88 (1997; Zbl 0904.94026)] on codes from fiber products of hyperelliptic curves. There is also a chapter on decoding in this part that treats the Skorobogatov-Vladut basic algorithm for decoding algebraic geometric codes, as well as decoding algorithms due to Porter, Erhard, and Duursma. There are exercises at the end of each chapter, with hints given for the more difficult ones. There is an extensive bibliography of over 200 papers and books. A few topics, such as generalized Hamming weights and applications of Gröbner bases to codes, do not appear in this book, but it is nonetheless one of the most comprehensive introductions to geometric codes to appear to date.

Recommendations

Cited in

(41)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508191)