This book links two subjects: algebraic geometry and coding theory. It uses a novel approach based on the theory of algebraic function fields. Coverage includes the Riemann-Rock theorem, zeta functions and Hasse-Weil's theorem as well as Goppa' s algebraic-geometric codes and other traditional codes. It will be useful to researchers in algebraic geometry and coding theory and computer scientists and engineers in information transmission.
This book links two subjects: algebraic geometry and coding theory. It uses a novel approach based on the theory of algebraic function fields. Coverage includes the Riemann-Rock theorem, zeta functions and Hasse-Weil's theorem as well as Goppa' s algebraic-geometric codes and other traditional codes. It will be useful to researchers in algebraic geometry and coding theory and computer scientists and engineers in information transmission.
This book has two objectives. The first is to fill a void in the existing mathematical literature by providing a modern, self-contained and in-depth exposition of the theory of algebraic function fields. Topics include the Riemann-Roch theorem, algebraic extensions of function fields, ramifications theory and differentials. Particular emphasis is placed on function fields over a finite constant field, leading into zeta functions and the Hasse-Weil theorem. Numerous examples illustrate the general theory. Error-correcting codes are in widespread use for the reliable transmission of information. Perhaps the most fascinating of all the ties that link the theory of these codes to mathematics is the construction by V.D. Goppa, of powerful codes using techniques borrowed from algebraic geometry. Algebraic function fields provide the most elementary approach to Goppa's ideas, and the second objective of this book is to provide an introduction to Goppa's algebraic-geometric codes along these lines. The codes, their parameters and links with traditional codes such as classical Goppa, Peed-Solomon and BCH codes are treated at an early stage of the book. Subsequent chapters include a decoding algorithm for these codes as well as a discussion of their subfield subcodes and trace codes. Stichtenoth's book will be very useful to students and researchers in algebraic geometry and coding theory and to computer scientists and engineers interested in information transmission.
The fields of algebraic functions of one variable appear in several areas of mathematics: complex analysis, algebraic geometry, and number theory. This text adopts the latter perspective by applying an arithmetic-algebraic viewpoint to the study of function fields as part of the algebraic theory of numbers. The examination explains both the similarities and fundamental differences between function fields and number fields, including many exercises and examples to enhance understanding and motivate further study. The only prerequisites are a basic knowledge of field theory, complex analysis, and some commutative algebra.
Early in the development of number theory, it was noticed that the ring of integers has many properties in common with the ring of polynomials over a finite field. The first part of this book illustrates this relationship by presenting analogues of various theorems. The later chapters probe the analogy between global function fields and algebraic number fields. Topics include the ABC-conjecture, Brumer-Stark conjecture, and Drinfeld modules.
This textbook equips graduate students and advanced undergraduates with the necessary theoretical tools for applying algebraic geometry to information theory, and it covers primary applications in coding theory and cryptography. Harald Niederreiter and Chaoping Xing provide the first detailed discussion of the interplay between nonsingular projective curves and algebraic function fields over finite fields. This interplay is fundamental to research in the field today, yet until now no other textbook has featured complete proofs of it. Niederreiter and Xing cover classical applications like algebraic-geometry codes and elliptic-curve cryptosystems as well as material not treated by other books, including function-field codes, digital nets, code-based public-key cryptosystems, and frameproof codes. Combining a systematic development of theory with a broad selection of real-world applications, this is the most comprehensive yet accessible introduction to the field available. Introduces graduate students and advanced undergraduates to the foundations of algebraic geometry for applications to information theory Provides the first detailed discussion of the interplay between projective curves and algebraic function fields over finite fields Includes applications to coding theory and cryptography Covers the latest advances in algebraic-geometry codes Features applications to cryptography not treated in other books
This book provides an accessible and self-contained introduction to the theory of algebraic curves over a finite field, a subject that has been of fundamental importance to mathematics for many years and that has essential applications in areas such as finite geometry, number theory, error-correcting codes, and cryptology. Unlike other books, this one emphasizes the algebraic geometry rather than the function field approach to algebraic curves. The authors begin by developing the general theory of curves over any field, highlighting peculiarities occurring for positive characteristic and requiring of the reader only basic knowledge of algebra and geometry. The special properties that a curve over a finite field can have are then discussed. The geometrical theory of linear series is used to find estimates for the number of rational points on a curve, following the theory of Stöhr and Voloch. The approach of Hasse and Weil via zeta functions is explained, and then attention turns to more advanced results: a state-of-the-art introduction to maximal curves over finite fields is provided; a comprehensive account is given of the automorphism group of a curve; and some applications to coding theory and finite geometry are described. The book includes many examples and exercises. It is an indispensable resource for researchers and the ideal textbook for graduate students.
This book gives an introduction to algebraic functions and projective curves. It covers a wide range of material by dispensing with the machinery of algebraic geometry and proceeding directly via valuation theory to the main results on function fields. It also develops the theory of singular curves by studying maps to projective space, including topics such as Weierstrass points in characteristic p, and the Gorenstein relations for singularities of plane curves.
The inaugural research program of the Institute for Mathematical Sciences at the National University of Singapore took place from July to December 2001 and was devoted to coding theory and cryptology. As part of the program, tutorials for graduate students and junior researchers were given by world-renowned scholars. These tutorials covered fundamental aspects of coding theory and cryptology and were designed to prepare for original research in these areas. The present volume collects the expanded lecture notes of these tutorials. The topics range from mathematical areas such as computational number theory, exponential sums and algebraic function fields through coding-theory subjects such as extremal problems, quantum error-correcting codes and algebraic-geometry codes to cryptologic subjects such as stream ciphers, public-key infrastructures, key management, authentication schemes and distributed system security.
