Codes and Curves


Book Description

Algebraic geometry is introduced, with particular attention given to projective curves, rational functions and divisors. The construction of algebraic geometric codes is given, and the Tsfasman-Vladut-Zink result mentioned above it discussed."--BOOK JACKET.




Codes on Algebraic Curves


Book Description

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.




Algebraic Codes for Data Transmission


Book Description

The need to transmit and store massive amounts of data reliably and without error is a vital part of modern communications systems. Error-correcting codes play a fundamental role in minimising data corruption caused by defects such as noise, interference, crosstalk and packet loss. This book provides an accessible introduction to the basic elements of algebraic codes, and discusses their use in a variety of applications. The author describes a range of important coding techniques, including Reed-Solomon codes, BCH codes, trellis codes, and turbocodes. Throughout the book, mathematical theory is illustrated by reference to many practical examples. The book was first published in 2003 and is aimed at graduate students of electrical and computer engineering, and at practising engineers whose work involves communications or signal processing.




Codes and Algebraic Curves


Book Description

The geometry of curves has fascinated mathematicians for 2500 years, and the theory has become highly abstract. Recently links have been made with the subject of error correction, leading to the creation of geometric Goppa codes, a new and important area of coding theory. This book is an updated and extended version of the last part of the successful book Error-Correcting Codes and Finite Fields. It provides an elementary introduction to Goppa codes, and includes many examples, calculations, and applications. The book is in two parts with an emphasis on motivation, and applications of the theory take precedence over proofs of theorems. The formal theory is, however, provided in the second part of the book, and several of the concepts and proofs have been simplified without sacrificing rigour.




Advances In Algebraic Geometry Codes


Book Description

Advances in Algebraic Geometry Codes presents the most successful applications of algebraic geometry to the field of error-correcting codes, which are used in the industry when one sends information through a noisy channel. The noise in a channel is the corruption of a part of the information due to either interferences in the telecommunications or degradation of the information-storing support (for instance, compact disc). An error-correcting code thus adds extra information to the message to be transmitted with the aim of recovering the sent information. With contributions from renowned researchers, this pioneering book will be of value to mathematicians, computer scientists, and engineers in information theory.




Codes, Cryptology and Curves with Computer Algebra


Book Description

This well-balanced text touches on theoretical and applied aspects of protecting digital data. The reader is provided with the basic theory and is then shown deeper fascinating detail, including the current state of the art. Readers will soon become familiar with methods of protecting digital data while it is transmitted, as well as while the data is being stored. Both basic and advanced error-correcting codes are introduced together with numerous results on their parameters and properties. The authors explain how to apply these codes to symmetric and public key cryptosystems and secret sharing. Interesting approaches based on polynomial systems solving are applied to cryptography and decoding codes. Computer algebra systems are also used to provide an understanding of how objects introduced in the book are constructed, and how their properties can be examined. This book is designed for Masters-level students studying mathematics, computer science, electrical engineering or physics.




Codes on Algebraic Curves


Book Description

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.




Algebraic Curves and Their Applications


Book Description

This volume contains a collection of papers on algebraic curves and their applications. While algebraic curves traditionally have provided a path toward modern algebraic geometry, they also provide many applications in number theory, computer security and cryptography, coding theory, differential equations, and more. Papers cover topics such as the rational torsion points of elliptic curves, arithmetic statistics in the moduli space of curves, combinatorial descriptions of semistable hyperelliptic curves over local fields, heights on weighted projective spaces, automorphism groups of curves, hyperelliptic curves, dessins d'enfants, applications to Painlevé equations, descent on real algebraic varieties, quadratic residue codes based on hyperelliptic curves, and Abelian varieties and cryptography. This book will be a valuable resource for people interested in algebraic curves and their connections to other branches of mathematics.




Algebraic Geometry Codes: Advanced Chapters


Book Description

Algebraic Geometry Codes: Advanced Chapters is devoted to the theory of algebraic geometry codes, a subject related to local_libraryBook Catalogseveral domains of mathematics. On one hand, it involves such classical areas as algebraic geometry and number theory; on the other, it is connected to information transmission theory, combinatorics, finite geometries, dense packings, and so on. The book gives a unique perspective on the subject. Whereas most books on coding theory start with elementary concepts and then develop them in the framework of coding theory itself within, this book systematically presents meaningful and important connections of coding theory with algebraic geometry and number theory. Among many topics treated in the book, the following should be mentioned: curves with many points over finite fields, class field theory, asymptotic theory of global fields, decoding, sphere packing, codes from multi-dimensional varieties, and applications of algebraic geometry codes. The book is the natural continuation of Algebraic Geometric Codes: Basic Notions by the same authors. The concise exposition of the first volume is included as an appendix.




Algebraic Function Fields and Codes


Book Description

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.