scientific article; zbMATH DE number 1104924
algebraic curvesalgebraic function fieldsasymptotic Gilbert boundgeometric Goppa codesRiemann-Roch theoremSkorobogatov-Vladut decoding algorithm
Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Field extensions (12F99) Valuation rings (13F30) Arithmetic ground fields for curves (14H25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Combinatorial codes (94B25)
This text is divided into two distinct parts. In Part I, called ``Codes from algebraic curves, the author gives a survey of the theory of algebraic curves, and gives the definition and main properties of geometric Goppa codes. This part of the book is very similar to the last five chapters of a previous text by the author [Error-correcting codes and finite fields, Oxford Applied Mathematics and Computing Science Series, Clarendon Press, Oxford (1992; Zbl 0754.94011)]. While some proofs of algebraic results are given in this part, the main theorems, such as the Riemann-Roch Theorem, are stated without proof. The emphasis in this part is on practical computation in examples, and detailed examples involving smooth plane curves are presented. There are also two chapters at the end of Part I that discuss decoding of geometric Goppa codes. The first of these chapters explains the Skorobogatov-Vladut decoding algorithm, while the second treats the algorithm of \textit{I. Duursma} [IEEE Trans. Inf. Theory 39, No. 3, 1067-1070 (1993; Zbl 0783.94022)], which incorporates the majority logic ideas of Feng and Rao to decode up to the designed minimum distance. In Part II, entitled ``Fields of algebraic functions, the author changes to the language of function fields and gives complete proofs. An algebraic proof of the Riemann-Roch Theorem, using a slightly modified definition of repartitions, is given. The author makes useful remarks showing how repartitions and Weil differentials yield algebraic analogues to the Residue Theorem and Cauchy Theorem from complex analysis. This part of the book is similar to chapters I and III from the text by \textit{H. Stichtenoth} [Algebraic function fields and codes, Springer-Verlag, Berlin (1993; Zbl 0816.14011)]. In the penultimate chapter of the book, the different viewpoints of algebraic curves and function fields are reconciled. In the final chapter, the author discusses the theorem of Tsfasman, Vladut, and Zink on geometric Goppa codes that better the asymptotic Gilbert bound, and the recent explicit asymptotically good families of function fields given by \textit{A. Garcia} and \textit{H. Stichtenoth} [Invent. Math. 121, No. 1, 211-222 (1995; Zbl 0822.11078)]. The author assumes that the reader is familiar with the basic concepts of coding theory, including the theory of finite fields. There are exercises at the end of each chapter. While the author states that most of the second part can be read without reading the first part, it would be difficult to understand the examples and exercises if one proceeded this way. While the text is clear and well-written with many helpful examples, there are some aspects that are not completely satisfying. Some of the notation used is not standard; for example, the author uses \(k[\dot x,\dot y]\) to denote a polynomial ring in two indeterminates, while \(k[x,y]\) denotes a quotient of this polynomial ring. (While it is helpful to distinguish these two, the reviewer prefers using capital letters for indeterminates, as was done in the commutative algebra text by Zariski and Samuel.) The index of specialty of a divisor is denoted by \(j(D)\). There is no discussion of Weierstrass points, although the author deals extensively with Riemann-Roch spaces of the form \(L(nP)\). The Frobenius automorphism appears at one point, but is not named. On the whole, this book should prove useful to students trying to learn about geometric codes.
- Codes from curves with total inflection points
- Trace codes and families of algebraic curves
- Multi point AG codes on the GK maximal curve
- Computing singular points of projective plane algebraic curves by homotopy continuation methods
- On the hardnesses of several quantum decoding problems
- scientific article; zbMATH DE number 5947819 (Why is no real title available?)
- scientific article; zbMATH DE number 6341749 (Why is no real title available?)
- Algebraic Function Fields and Codes
- Algebraic Geometry Codes from Castle Curves
- Algebraic geometric codes. Basic notions
- scientific article; zbMATH DE number 41323 (Why is no real title available?)
- scientific article; zbMATH DE number 47606 (Why is no real title available?)
- Fast decoding of codes from algebraic curves
- Curves over finite fields and codes
- Constructing codes from algebraic curves
- scientific article; zbMATH DE number 1512349 (Why is no real title available?)
- scientific article; zbMATH DE number 1756457 (Why is no real title available?)
- Algebraic geometry codes: advanced chapters
- Yet More Projective Curves over F2
- Scroll codes over curves of higher genus
- Hermitian-Singer functional and differential codes
- Algebraic function fields and codes
- Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9
- Hermitian codes with automorphism group isomorphic to \(\operatorname{PGL}(2,q)\) with \(q\) odd
- List decoding of Hermitian codes using Gröbner bases
- Modular curves and codes with polynomial complexity of construction
- Codes defined from some maximal curves
- Decoding by rank-2 bundles over plane quartics
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 Q4370591)