Modular curves and codes with polynomial complexity of construction
From MaRDI portal
Publication:761415
zbMath0555.94008MaRDI QIDQ761415
G. L. Katsman, S. G. Vleduts, Michael A. Tsfasman
Publication date: 1984
Published in: Problems of Information Transmission (Search for Journal in Brave)
modular curvesbinary codesconcatenated codes\(q\)-ary block codespolynomial complexity of construction
Related Items
Linear codes and modular curves ⋮ Constructive high-dimensional sphere packings ⋮ Polynomial-time construction of codes. I: Linear codes with almost equal weights