Polynomial-time construction of codes. I: Linear codes with almost equal weights

DOI10.1007/BF01387197zbMath0757.94014MaRDI QIDQ1201338

Jacques Stern, Gilles Lachaud

Publication date: 17 January 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

weightslinear codespolynomial complexityasymptotic boundsdisparityconcatenationReed-Müller codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Arithmetic, Geometry, and Coding Theory: Homage to Gilles Lachaud

Cites Work

• Modular curves and codes with polynomial complexity of construction
• The parameters of projective Reed-Müller codes
• Modular curves and codes with a polynomial construction
• ALGEBRAICO-GEOMETRIC CODES
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial-time construction of codes. I: Linear codes with almost equal weights