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 booksIf g = 0, that is, if F is the rational function field over Fq, then any AG code in Theorem 5.2.2 is an MDS code (compare with ... Such a code is called a Hermitian code. Example 5.2.6. Take q = 2 and m = 4 in Example 5.2.5, so that G = 4Q.
|Title||:||Algebraic Geometry in Coding Theory and Cryptography|
|Author||:||Harald Niederreiter, Chaoping Xing|
|Publisher||:||Princeton University Press - 2009-09-21|