Many rational points. Coding theory and algebraic geometry
coding theorycryptographycurvesDeligne-Lusztig spacesDrinfeld modulefinite fieldsGoppa codesrational pointsShimura curves
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Research exposition (monographs, survey articles) pertaining to algebraic geometry (14-02) Rational points (14G05) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
This book gives a nice overview of background and recent results on curves over finite fields. The theorem of Hasse-Weil gives bounds on the possible number of points on a curve over a finite field depending on the genus. For applications in coding theory one is interested in curves with many points (hence the name of the book) as that rules the size of the code. Hurt collects results on the mathematical background as well as on the applications in coding theory and cryptography. The book also comprises results on Deligne-Lusztig spaces, Drinfeld modules, and Shimura curves. The main advantage of this book is that it provides a huge bibliography and takes into account even very recent results which are so far only presented at conferences or in preprints. So it serves well to get an update on recent results for the experienced reader and links to the original results for more details. Obviously, there is not enough space for providing detailed background or even proofs -- however, sometimes it would be advantageous for the reader if the relevance of the distinct results would have been stressed. This might be asking too much in the case of new results for which the relevance is not yet established or is hard to estimate -- but the reader should be warned that this task remains on him.
- On maximal curves with Frobenius dimension 3
- On maximal curves related to Chebyshev polynomials
- On the spectrum for the genera of maximal curves over small fields
- The curve \(y^n=x^\ell(x^m+1)\) over finite fields. II
- A note on some Picard curves over finite fields
- Some Ree and Suzuki curves are not Galois covered by the Hermitian curve
- On the curve \(Y^n= X^{\ell}(X^m + 1)\) over finite fields
- On space maximal curves
- Algebraic geometry in coding theory and cryptography
- Galois points for a plane curve in characteristic two
- Coding true arithmetic in the Medvedev degrees of ^0_1 classes
- scientific article; zbMATH DE number 1009711 (Why is no real title available?)
- Curves with many points and their applications
- Algebraic curves and their applications
- Lines on Cubic Hypersurfaces Over Finite Fields
- Automorphism groups of smooth plane curves with many Galois points
- A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$
- Rational points on curves over finite fields. With contributions by Everett Howe, Joseph Oesterlé and Christophe Ritzenthaler. Edited by Alp Bassa, Elisa Lorenzo García, Christophe Ritzenthaler and René Schoof
- The arithmetic of curves defined by iteration
- Algebraic curves over a finite field
- Fast enumeration of superspecial hyperelliptic curves of genus 4 with automorphism group \(V_4\)
- Some results on Sylow numbers of finite groups.
- Further examples of maximal curves which cannot be covered by the Hermitian curve
- A new family of maximal curves over a finite field
This page was built for publication: Many rational points. Coding theory and algebraic geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4827948)
