Modular curves and codes with polynomial complexity of construction
From MaRDI portal
The authors construct and analyze linear \(q\)-ary codes that arise from modular Drinfel'd curves, and the associated binary codes. All these codes have polynomial complexity of construction and ``good asymptotic parameters: \(q\)-ary codes for \(q=p^{2m}\geq 49\) lie above the Varshamov-Gilbert bound on some segment, while binary codes lie above the Blokh-Zyablov bound everywhere.
Recommendations
- Modular curves and codes with a polynomial construction
- Modular curves and coding theory: a survey
- Linear codes and modular curves
- scientific article; zbMATH DE number 1944665
- Constructing codes from algebraic curves
- scientific article; zbMATH DE number 1488180
- scientific article; zbMATH DE number 1461541
- Coding theory and algebraic curves over finite fields
- scientific article; zbMATH DE number 1104924
- scientific article; zbMATH DE number 1512349
Cited in
(9)- Linear codes and modular curves
- Constructive high-dimensional sphere packings
- Polynomial-time construction of codes. I: Linear codes with almost equal weights
- A special integral basis for a plane model of the Drinfeld modular curve \(X_1(n)\bmod T\)
- Modular curves and coding theory: a survey
- Modular curves and codes with a polynomial construction
- Codes et formes paramodulaires
- scientific article; zbMATH DE number 1461541 (Why is no real title available?)
- Excellent codes from modular curves
This page was built for publication: Modular curves and codes with polynomial complexity of construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761415)
