On the covering radius of long Goppa codes

DOI10.1007/3-540-60114-7_26MaRDI QIDQ4352824zbMATH OpenFDO

Authors Françoise Levy-dit-Vehel, Simon Litsyn

Publication date 28 February 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60114-7_26

zbMATH Keywords

covering radiusGoppa codes

Mathematics Subject Classification ID

Exponential sums (11T23) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• scientific article; zbMATH DE number 4160649
• On the covering radius of codes
• Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes
• Lower bound of covering radius of binary irreducible Goppa codes
• On the covering radius of long binary BCH codes
• scientific article; zbMATH DE number 4041787
• Further results on the covering radius of codes
• On the covering radius of binary, linear codes meeting the Griesmer bound
• The Generalized Covering Radii of Linear Codes

Cited in

(2)

• Exponential Sums and Goppa Codes: I
• New bounds on the distance distribution of extended Goppa codes

This page was built for publication: On the covering radius of long Goppa codes

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