Codes on Drinfeld modular curves

MaRDI QIDQ4485871zbMATH OpenFDO

Authors Bartolomé López, Ignacio Luengo

Publication date 20 June 2000

zbMATH Keywords

algebraic-geometric codesBrill-Noether algorithmcomputational complexityDrinfeld modular curves

Mathematics Subject Classification ID

Drinfel'd modules; higher-dimensional motives, etc. (11G09) Curves over finite and local fields (11G20) Arithmetic theory of algebraic function fields (11R58) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

The authors drastically improve an old estimate of the computational complexity of constructing algebraic-geometric codes based on Drinfeld modular curves. \textit{Y. Manin} and \textit{S. Vladut} [J. Sov. Math. 30, 2611-2643 (1985); translation from Itogi Nauki Tekh., Ser. Sovrem. Probl. Mat. 25, 209-257 (1984; Zbl 0629.94013)] give an algorithm to construct good families of codes using a family of Drinfeld modular curves. To do so, they use a plane model \(C_1(I)\) of the reduction \(\text{mod }T\) of the Drinfeld modular curve \(X_1(I)\), \(I\) a prime ideal in the polynomial ring \(F_q(T)\), \(F_q\) a finite field. The algorithm constructs the generator matrix of a Goppa code \(C_L(P, G)\), with \(P\), \(G\) appropriate divisors, defined over \(F_{q^2}\). The algorithm has complexity \(O(n^{32})\), \(n\) being the length of the code. In his doctoral thesis [Plane models of Drinfeld modular curves, Thesis, U. Complutense, Madrid (1996)], \textit{B. Lopez} obtains the estimate \(O(n^{17})\), and the present paper improves this estimate to \(O(n^{12})\). In section 1 the paper refers to B. Lopez [Thesis] and to \textit{M. Tsfasman} and \textit{S. Vladut} [Algebraic-geometric codes, in Math. Appl. Soviet Ser. 58, Kluwer (1991; Zbl 0727.94007)] for the main results about \(C_1(I)\), section 2 recalls the Brill-Noether algorithm used to construct a set of generators of the vector space \(L(G)\), and section 3 recalls the Manin-Vladut construction and describes the authors' algorithm. Finally, we point out a minor problem that can make the reading of the paper harder: while the results (propositions, lemmas and remarks) are numbered with two numbers (section result) they are quoted using a consecutive numbering (for instance proposition 7 must be understood as proposition 2.2). For the entire collection see [Zbl 0930.00089].

Recommendations

• scientific article; zbMATH DE number 3983069
• Linear codes and modular curves
• A special integral basis for a plane model of the Drinfeld modular curve \(X_1(n)\bmod T\)
• Excellent codes from modular curves
• Modular curves and codes with polynomial complexity of construction
• scientific article; zbMATH DE number 52606
• scientific article; zbMATH DE number 52992
• Achieving the designed error capacity in decoding algebraic-geometric codes
• On the decoding of algebraic-geometric codes over F/sub q/ for q<or=16
• scientific article; zbMATH DE number 4004353

Cited in

(5)

• A special integral basis for a plane model of the Drinfeld modular curve \(X_1(n)\bmod T\)
• Half plane models for divides, their knots and Dowker-Thistlethwaite codes
• Modular curves and codes with a polynomial construction
• scientific article; zbMATH DE number 3983069 (Why is no real title available?)
• Modular curves and codes with polynomial complexity of construction

This page was built for publication: Codes on Drinfeld modular curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485871)