A proof of the Brill-Noether method from scratch
The authors present a direct and self-contained exposition of the Brill-Noether method for computing Riemann-Roch spaces on algebraic curves. The tools used in this paper are Newton polygons, Hensel lifting lemma, bivariate resultants, and Chinese reminder. This approach makes the paper suitable for students and other mathematicians outside pure algebraic geometry. Applications to error-correcting codes and secret sharing schemes are outlined, highlighting the method's relevance to computational algebra and cryptography. The clear structure and elementary presentation make this article a valuable resource for both teaching and algorithmic implementation.
- A fast randomized geometric algorithm for computing Riemann-Roch spaces
- Algebraic curves, the Brill and Noether way
- Algebraic Function Fields and Codes
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Algebraic geometry codes and some appliations
- Algorithme de Brill-Noether et codes de Goppa
- An Arithmetic Theory of Adjoint Plane Curves
- Asymptotically fast group operations on Jacobians of general curves
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Computational linear and commutative algebra
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- Computing Riemann-Roch spaces via Puiseux expansions
- Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- Geometric theory of algebraic space curves
- Good and asymptotically good quantum codes derived from algebraic geometry
- How arithmetic and geometry make error correcting codes better
- How to share a secret
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3891516 (Why is no real title available?)
- scientific article; zbMATH DE number 5003314 (Why is no real title available?)
- scientific article; zbMATH DE number 4146129 (Why is no real title available?)
- scientific article; zbMATH DE number 3457046 (Why is no real title available?)
- scientific article; zbMATH DE number 3634396 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1057752 (Why is no real title available?)
- scientific article; zbMATH DE number 194422 (Why is no real title available?)
- scientific article; zbMATH DE number 799781 (Why is no real title available?)
- Interactive oracle proofs of proximity to algebraic geometry codes
- Locally recoverable codes on algebraic curves
- Modern computer algebra
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- On algebraic functions and the use in geometry.
- On the theory of adjoints. II
- Sub-quadratic time for riemann-roch spaces
- Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
- The torsion-limit for algebraic function fields and its application to arithmetic secret sharing
- Three algorithms in algebraic geometry, coding theory and singularity theory
- Using Algebraic Geometry
This page was built for publication: A proof of the Brill-Noether method from scratch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021270)
