scientific article; zbMATH DE number 1461541

MaRDI QIDQ4485871zbMATH OpenFDO

Authors Bartolomé López, Ignacio Luengo

Publication date 20 June 2000

zbMATH Keywords

computational complexityDrinfeld modular curvesalgebraic-geometric codesBrill-Noether algorithm

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)

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)

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

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 Q4485871)