Modular curves and codes with a polynomial construction

DOI10.1109/TIT.1984.1056879zbMath0544.94016OpenAlexW2085220484MaRDI QIDQ3335681

G. L. Katsman, S. G. Vleduts, Michael A. Tsfasman

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

modular curvesconcatenated codespolynomial complexity of constructionlower bound for the rate of binary codesmaximal possible rateq-ary block code

Mathematics Subject Classification ID

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

Related Items (3)

Separation and Witnesses ⋮ Generalized hashing and parent-identifying codes. ⋮ Polynomial-time construction of codes. I: Linear codes with almost equal weights

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