Modular curves and codes with polynomial complexity of construction

zbMATH Open0555.94008MaRDI QIDQ761415FDOQ761415

Authors: G. L. Katsman, Serge Vlăduţ, Mikhail Anatolievich Tsfasman 

Publication date: 1984

Published in: Problems of Information Transmission (Search for Journal in Brave)

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

zbMATH Keywords

binary codesmodular curvesconcatenated codes\(q\)-ary block codespolynomial complexity of construction

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Special algebraic curves and curves of low genus (14H45)

Cited In (8)

• 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\)
• Title not available (Why is that?)
• Linear codes and modular curves
• Excellent codes from modular curves
• Polynomial-time construction of codes. I: Linear codes with almost equal weights
• Modular curves and coding theory: a survey
• Constructive high-dimensional sphere packings

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)