Modular curves and codes with a polynomial construction

DOI10.1109/TIT.1984.1056879MaRDI QIDQ3335681zbMATH OpenOpenAlexFDO

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

Publication date 1984

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1984.1056879

zbMATH Keywords

concatenated codeslower bound for the rate of binary codesmaximal possible ratemodular curvespolynomial complexity of constructionq-ary block code

Mathematics Subject Classification ID

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

Recommendations

• Modular curves and codes with polynomial complexity of construction
• Excellent codes from modular curves
• Linear codes and modular curves
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• scientific article; zbMATH DE number 1461541

Cited in

(6)

• Polynomial-time construction of codes. I: Linear codes with almost equal weights
• Generalized hashing and parent-identifying codes.
• Excellent codes from modular curves
• Separation and Witnesses
• Locally recoverable algebro-geometric codes from projective bundles
• Modular curves and codes with polynomial complexity of construction

This page was built for publication: Modular curves and codes with a polynomial construction

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