scientific article; zbMATH DE number 3983069
[For the entire collection see Zbl 0591.00036.] I present an outline of my translation with \textit{M. Deza} [Publ. Math. Univ. Pierre Marie Curie 72 (1985) (en français)] of a recent work by \textit{Yu. I. Manin} and \textit{S. G. Vlădut}: Linear codes and modular curves, giving in detail the proof of polynomial complexity of algebraico-geometric codes (following \textit{V. D. Goppa} [Izv. Akad. Nauk SSSR, Ser. Mat. 46, 762-781 (1982; Zbl 0522.94013)]) coming from Drinfeld elliptic-moduli. Also, I consider computational aspects of a generalization of the Brill-Noether construction, giving a basis of \({\mathcal L}(D)\) where D if an \({\mathbb{F}}_ q\)-rational divisor of a singular plane curve. (This is a joint-work with \textit{J. J. Risler}).
- The complexity of linear problems in fields
- A special integral basis for a plane model of the Drinfeld modular curve \(X_1(n)\bmod T\)
- The complexity of computing all subfields of an algebraic number field
- Computational aspects of retrieving a representation of an algebraic geometry code
- scientific article; zbMATH DE number 1809826 (Why is no real title available?)
- A Polynomial Time Complexity Bound for Computations on Curves
- Codes on Drinfeld modular curves
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 Q3748196)